User positioning

ABSTRACT

The invention proposes a method for locating a network element, comprising the steps of obtaining (S1) the coordinates (xS, yS) of a second network element (BTS) to which the first network element (MS) is connected or attached; detecting (S2) a serving area (S), which is served by the second network element (BTS); detecting (S3) a propagation delay of the first network element with respect to the second network element (BTS); determining (S4) a propagation delay depending area (C), which is an area having a distance to the second network element (BTS) based on the propagation delay and a width based on the propagation delay; and forming (S5) an intersection area (I) of the serving area (S) and the propagation delay depending area (C); wherein a location estimate of the first network element (MS) is determined (S6) from the intersection area (I). Thus, an uncertainty area where a first network element is located can be reduced and the location accuracy can be improved.

FIELD OF THE INVENTION

[0001] The present invention relates to a method and a network control device for locating a network element and, thus, for locating a user of such a network element.

BACKGROUND OF THE INVENTION

[0002] The need for an efficient and accurate user positioning in wireless networks grows day by day. The position estimation of wireless callers to emergency numbers, as the “Enhanced-911” (E-911) mandatory in the U.S. by October 2001 and the E-112 under consideration by the European Community, is only one of the possible applications beside vehicle fleet management, intelligent transport systems (ITS's) and location-based billing.

[0003] To guarantee positioning in the whole coverage area, achieve different service requirements and handle the variety of location information, combinations of different location technologies have been considered and suitable signaling protocols proposed. Standardization of Mobile Stations (MS's) positioning in GSM networks started in 1995 within ETSI SMG (European Telecommunications Standards Institute Special Group Mobile) 1 after European operators asked for commercial services based on MS positioning and separately within T1P1 in the U.S., after the FCC (Federal Communications Commission) established the requirements for the E-911 service.

[0004] In 1997 the T1P1.5 subcommittee of T1P1 (T1P1 is a subgroup of T1, a committee of TIA, the North American Telecommunications Industry Association) was given the responsibility to lead the standardization activities. At the conclusion of the works, T1P1.5 proposed four positioning alternatives: three using measurements performed within the cellular network; namely, the Timing Advance (TA), Uplink Time Of Arrival (TOA) and Enhanced Observed Time Difference (E-OTD) procedures and one based on the Global Positioning System (GPS) technology, the Network-Assisted GPS procedure. All four procedures were included by ETSI in the GSM specifications Release '98 and Release '99 (see ETSI, “Digital Cellular Telecommunications System (Phase 2+); Location Services (LCS), (Functional Description)—Stage 2 (GSM 03.71 version 7.3.0 Release 1998)”—doc. ETSI TS 101 724, February 2000).

[0005] The Uplink TOA procedure is able to locate legacy handsets (i.e., handsets with standard software) but requires installation of new network elements called LMUs (Location Measurement Units) at each BTS site. The Enhanced OTD procedure requires installation of LMUs every 2-5 BTS's and software modification in the terminals. Also the Network-Assisted GPS procedure requires installation of reference GPS receivers besides the integration of a GPS receiver into the handset.

[0006] All procedures, including the Timing Advance, require the introduction of a new network element responsible for the location calculation called SMLC (Serving Mobile Location Center).

[0007] The principle of the Timing Advance is illustrated in FIG. 1. The Timing Advance (TA) describes the back-and-forth propagation time between the mobile station and the serving base station. It is used to avoid overlapping slots in communications. The distance d between the serving base station and the mobile station can be estimated using the TA:

d≅TA×(cT _(b)/2)

[0008] where T_(b)=3.69 μs is the bit period, c=3×10⁸ m/s is the speed of radio waves, and TA is an integer ranging from 0 to 63.

[0009] The Timing Advance procedure is the simplest procedure among the standardized ones. It requires only the addition of location calculation functionalities (i.e., the SMLC) in the network side and, since it uses information already available in nowadays networks, it is able to locate legacy handsets and it does not need the installation of additional measurement units.

[0010] The Timing Advance procedure can be applied also as back-up procedures for other standardized solutions. In some cases, in fact, the number of Base Transceiver Stations (BTS's) in case of Uplink TOA/Enhanced OTD or satellites, in case of Network-Assisted GPS, that can be used for positioning purposes is low or the quality of the measurement is so poor that none of such technologies can be used. The estimations obtained by using the Timing Advance technique can also be used as initial guess for the algorithms used to implement one of the standardized solutions (e.g. the E-OTD), in order to improve accuracy or speed of convergence of those algorithms.

SUMMARY OF THE INVENTION

[0011] Therefore, the object underlying the invention resides in providing a low-cost method for positioning a user.

[0012] This object is solved by a method for locating a network element, comprising the steps of

[0013] obtaining the coordinates and the identity of a second network element to which the first network element is connected or attached;

[0014] detecting a serving area, which is served by the second network element;

[0015] detect a propagation delay of the first network element with respect to the second network element;

[0016] determining a propagation delay depending area, which is an area having a distance to the second network element based on the propagation delay or other distance measurement or quantity and a width based on the propagation delay; and

[0017] forming an intersection area of the serving area and the propagation delay depending area;

[0018] wherein a location estimate of the first network element is determined within the intersection area.

[0019] Alternatively, the above object is solved by a network control device for locating a first network element, comprising

[0020] a serving area determining means being adapted to obtain coordinates of a second network element, to which the first network element is connected or attached, and to detect a serving area, which is served by the second network element;

[0021] a propagation delay depending area detecting means being adapted to detect a propagation delay of the first network element with respect to the second network element, and to determine a propagation delay depending area, which is an area having a distance to the second network element based on the propagation delay and a width based on the propagation delay; and

[0022] a location estimating means being adapted to form an intersection area of the serving area and the Propagation delay depending area, and to determine a location estimate of the first network element from the intersection area.

[0023] Thus, by referring also to the serving area of the cell served by the second network element (e.g., a base station), the location accuracy can be improved since the actual area where the first network element may be located can be narrowed.

[0024] Furthermore, no additional hardware in the first network element is necessary. That is, a mobile station does not have to be provided with circuits dedicated for location purposes (like GPS or the like). Hence, no additional costs for mobile stations are required.

[0025] Moreover, the method according to the invention may be performed in a central network control device such that only in this device additional hardware (basically databases for the serving areas of a plurality of second network elements, i.e., base stations) are required.

[0026] The step of determining the propagation delay depending area may comprise the step of calculating an estimated distance and calculating a confidence interval for the estimated distance, wherein the propagation delay depending area is determined based on the estimated distance and the confidence interval. By this measure, the propagation delay depending area may be calculated more accurately.

[0027] The propagation delay depending area is a circular crown around the second network element, the radius and width thereof depending on the propagation delay. It is noted that the radius may be zero (e.g., in case the propagation delay is zero).

[0028] The estimated distance and the confidence interval may calculated based on statistical data of the propagation delay. By this measure, statistical distributions of the propagation delay can be taken into account. Hence, the propagation delay depending area can be determined more accurately, resulting in a further improvement of the accuracy of the location estimate. The statistical data comprises a propagation delay measurement error, for example.

[0029] Alternatively, the statistical data may comprise the estimation error of the distance between the two network elements as obtained by comparing the true distance and the distance estimated using the propagation delay.

[0030] Also, already available location information of the first network element may be used to form the statistical data. The already available location information of the first network element may be obtained using other, more accurate location methods, such as Enhanced Observed Time Difference (E-OTD), Angle OF Arrival (AOA), GPS, or Assisted-GPS.

[0031] The propagation delay may be indicated by a Timing Advance (TA). This value is represented in bits and is in particular already available. Hence, the propagation delay can easily be obtained.

[0032] The serving area may be a geographical area to which the second network element is associated. For example, the serving area may be defined by a geographical map. Thus, the serving area can be exactly defined.

[0033] The serving area (S) may be the geographical region the borders of which are mathematically defined by the coordinates of the origin (x₀,y₀), the orientation of the serving area measured taking (x₀,y₀) as origin of a polar reference (φ_(s)), the angular width of the serving area (Δφ_(s)), a front radius (R_(F)) which defines the distance from the origin (x₀,y₀) in the angular region inside the range φ_(s)±Δφ_(s), and a back radius (R_(B)) which defines the distance from the origin (x₀,y₀) in the angular region outside the range φ_(s)±Δφ_(s).

[0034] The step of obtaining the coordinates of the second network element can be performed by checking a Cell Identity of the cell the second network element is associated to. For example, in GSM this information is available, such that no additional hardware or software has to be provided in order to obtain the CI.

[0035] The calculation of location estimates may be performed in dependence on coordinates of the second network element and/or propagation delay values beforehand. That is, the location estimates can be calculated in non-real time. By this measure, the real-time calculation power required can be reduced strongly.

[0036] The location estimates calculated beforehand may be stored in look-up tables, wherein the location estimates can be retrieved based on the coordinates of the second network element and propagation delay. Thus, upon a location request, only an access on database (look-up tables) has to be performed, which lightens the real-time calculation load.

[0037] The first network element may be a mobile station (MS), whereas the second network element may be a base station.

[0038] The method may further comprise the steps of

[0039] identifying neighbor network elements, which can be received by the first network element, and

[0040] obtaining hearablity areas defining areas in which the signal level of neighbor network elements is equal or higher than a predetermined minimum signal level,

[0041] wherein the step of forming an intersection area comprises forming an intersection area of the serving area, the propagation delay depending area and the hearablity areas of those neighbor network elements identified by the first network element.

[0042] Thus, by using neighbor network elements (e.g., neighbor base stations), the intersection area can be further refined. Hence, the uncertainty area where the first network element may be located can be further reduced and the location accuracy can be improved.

[0043] The hearability area of each neighbor network element may be stored beforehand in a database, and wherein the step of obtaining the hearbility areas is performed by accessing the database. Hence, the actual calculation of location estimates can be performed in non-real time, such that no complex real-time calculations are necessary.

[0044] In the identifying step the strength (RXLEV) of a signal received from a neighbor network element is measured in GSM system by the first network element on the BCCH frequency of the neighbor network element. That is, information already available in GSM, for example, can be used in the method according to the invention. Therefore, no additional means for measuring the signal strength are required.

[0045] In the step of obtaining the hearability areas, the hearability areas may be ordered in dependence on the received signal strength, and wherein in the step of forming the intersection area the order is considered. Thus, the hearability areas having the highest signal strength are used first. Thus, it can be ensured that the first network element is indeed in such a hearability area. By this measure, the location accuracy can be further improved.

[0046] For each neighbor cell a plurality of coverage areas may be provided each of which has a different signal level, wherein the step of forming an intersection is performed by using the coverage areas having different signal levels. By this measure, not only the existence of neighbor network elements is considered, but also the signal strength thereof by selecting for each neighbor cell the coverage area within which the signal level corresponds to the measured one. Thus, the uncertainty area can be further reduced, such that the location accuracy can be further improved.

[0047] The method may further comprise the step of using information about a probability density of locations of the first network elements within the serving areas of second network elements. By this measure, external information are used which allow to judge the probability where a user of a first network element may be located. By this measure, the intersection area can be weighted such that the location estimate is not assumed in the center point of the intersection area, but is shifted corresponding to the probability density.

[0048] The probability density information may comprise empirical user density studies, geographical information, population density information, traffic information and the like.

[0049] The probability density information are stored beforehand in a database for each serving area. Thus, as mentioned above, the location estimate can be calculated beforehand in non-real time.

[0050] The location estimate of the first network element may be the center point of the intersection area, or, alternatively, the location estimate of the first network element may be the weighted center point of the intersection area using probability density of locations of first network elements as weight.

[0051] Furthermore, the confidence area of the first network element, where the first network element is located with a certain probability, may be estimated using the intersection area. The confidence area estimate may be the intersection area.

[0052] Alternatively, the confidence area of the first network, where the first network element is located with a certain probability, may be estimated using the serving area. That is, the confidence area estimate may be the serving area.

[0053] Moreover, the invention proposes a network control device for performing the method described above.

[0054] The network control device may further comprise a look-up table retrieving device adapted to access a look-up table storing location estimates which have been calculated beforehand in look-up tables, wherein the look-up table retrieving device is adapted to retrieve the location estimates based on the coordinates of the second network element and the propagation delay value.

[0055] The network control device may be a Location Server (LS).

[0056] In addition, the invention proposes a network location system comprising the above network control device and a network management device for preparing the look-up table. The network management device may be a Location Management Tool (LMT).

[0057] The intention also proposes a method for locating a network element, comprising the steps of

[0058] obtaining the identity of a second network element to which the first network element is connected or attached;

[0059] detecting a serving area, which is served by the second network element;

[0060] wherein a location estimate of the first network element is determined from the serving area.

[0061] Moreover, the invention proposes a method for locating a network element, comprising the steps of

[0062] identifying neighbor network elements, which can be received by the first network element, and

[0063] obtaining hearablity areas defining areas in which the signal level of neighbor network elements is equal or higher than a predetermined signal level, and

[0064] forming an intersection area of the hearablity areas of those neighbor network elements identified by the first network element,

[0065] wherein a location estimate of the first network element is determined from the intersection area.

[0066] In addition, the invention proposes a method for locating a network element, comprising the steps of

[0067] obtaining the coordinates and of a second network element to which the first network element is connected or attached;

[0068] detecting a propagation delay of the first network element with respect to the second network element;

[0069] determining a propagation delay depending area, which is an area having a distance to the second network element based on the propagation delay and a width based on the propagation delay; and

[0070] identifying neighbor network elements, which can be received by the first network element, and

[0071] obtaining hearablity areas defining areas in which the signal level of neighbor network elements is equal or higher than a predetermined signal level,

[0072] forming an intersection area of the propagation delay depending area and the hearablity areas of those neighbor network elements;

[0073] wherein a location estimate of the first network element is determined from the intersection area.

[0074] Furthermore, the invention proposes a method for locating a network element, comprising the steps of

[0075] obtaining the coordinates of a second network element to which the first network element is connected or attached; and

[0076] using information about a probability density of locations of first network elements,

[0077] wherein a location estimate of the first network element is determined from the probability.

[0078] By the above method, a location estimate can be determined with low costs, but still with sufficient accuracy.

[0079] The invention also proposes corresponding network control devices.

[0080] It is noted that in the present description, the terms “connected” and “attached” with respect to the first network element (e.g., MS) are meant as follows: If the MS is connected, it is active and has a communication going. If the MS is attached, it is turned on but it has not any communication going on, neither a channel assigned (for example, GSM mobile in idle mode, or “cramped” as it is usually said). Thus, according to the present invention, the location of the user can be determined when the MS is connected or attached. Hence, for locating a user it is not necessary that the user actually performs communication.

BRIEF DESCRIPTION OF THE DRAWINGS

[0081] The present invention will be more readily understood with reference to the accompanying drawings in which:

[0082]FIG. 1 shows a graphical representation of the TA concept,

[0083]FIG. 2 shows flow chart of the location procedure according to a first embodiment,

[0084]FIG. 3 shows an example of a serving area S,

[0085]FIG. 4 shows a constant-TA circular crown C,

[0086]FIG. 5 shows a MS location estimated as the center point of the intersection between serving area and constant-TA circular crown,

[0087]FIG. 6 shows the VELOCITA concept according to the first embodiment,

[0088]FIG. 7 shows a graphical representation of the TA quantization rule,

[0089]FIG. 8 shows an experimental histogram of the TA measurement error,

[0090]FIG. 9 shows a definition of estimate of distance and confidence interval of the distance estimate,

[0091]FIG. 10 shows an example of a CDF used as a reference to define the distance estimate,

[0092]FIG. 11 shows an example for the polar reference system,

[0093]FIG. 12 shows an application of the algorithm according to the first embodiment to determine the center point of the cell,

[0094]FIG. 13 shows the confidence region of the location estimate,

[0095]FIG. 14 shows an MS location estimated at the center point of the intersection between serving area (S), constant-TA circular crown (C) and hearability area of the first neighbor BTS (H₁) according to a second embodiment,

[0096]FIG. 15 shows an MS location estimated at the center point of the intersection area as in FIG. 14, wherein in addition coverage areas with different signal levels are considered, according to a third embodiment,

[0097]FIG. 16 shows a location estimate using CI and TA,

[0098]FIG. 17 shows a location estimate using CI only,

[0099]FIG. 18 shows a location estimate using geographical information to determine the distribution of users according to a fourth embodiment,

[0100]FIG. 19 shows a location estimate using information on the population density to determine the distribution of users according to the fourth embodiment,

[0101]FIG. 20 shows a location estimate using information on traffic density to determine the distribution of users according to the fourth embodiment, and

[0102]FIG. 21 shows the geometry of the problem according to the fourth embodiment.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

[0103] In the following, preferred embodiments of the invention is described in more detail with reference to the accompanying drawings.

[0104] First Embodiment

[0105] According to the first embodiment, an algorithm is used that extends the Timing Advance (TA) concept.

[0106] Namely, from the service deployment point of view, the Timing Advance procedure has a very high potential. Operators can start offering location services based on the Timing Advance system. Such services can be provided to all customers with reasonable additional costs (for both customers and operators). The introduction of services based on the Timing Advance procedure allows at the same time to build awareness and create needs of location-based services in the market. When a sufficient set of location-based services have been launched and the market demand for better location services exists, operators can start deploying more expensive location systems in their networks starting with the Enhanced OTD and continuing with the Assisted GPS.

[0107] The algorithm according to the first embodiment extends the Timing Advance (TA) concept by integrating the information available in the standardized Timing Advance solution with:

[0108] geographical map of the area served by the serving cell, and/or

[0109] statistical properties of the TA measurements.

[0110] For simplicity, the GSM system is referred to in the description of the embodiments. However, the present invention is applicable to all the existing systems based on the GSM standard (e.g., the GSM900, GSM1800 and the North American Personal Communication System, PCS 1900) and to all the systems that use measurements similar to the one considered in this document. In addition, the invention can also be applied to UMTS (Universal Mobile Telecommunication System) thanks to the Cell Coverage procedure supported by the standards Release 1999 and the Round Trip Time (RTT) similar to the GSM Timing Advance, which is planned to be supported in future releases of the UMTS standards.

[0111] The Timing Advance positioning procedures standardized for GSM Release 1998 and Release 1999 deliver to the Serving Mobile Location Center (SMLC) at least the following pieces of information:

[0112] Identity of the serving BTS (Cell Identity (CI)) and

[0113] Timing Advance (TA) from the serving BTS.

[0114] The CI identifies uniquely the BTS (Base Transceiver Station) that has in charge the communication with the MS (Mobile Station) to be located. The TA is an estimate of the propagation delay between MS and serving BTS, used in the GSM system to avoid overlapping of bursts at the BTS side.

[0115] Provided that a database containing the geographical coordinates of the BTS's in the network is available, the CI allows to determine the geographical location of the serving BTS. The TA can be used as an estimate of the distance between MS and serving BTS; thus the TA defines a circle (in a 2-dimensional scenario) centered in the serving BTS on which the MS can be located.

[0116] The TA-circle is the simplest location information that can be determined by combining CI and TA. However, with the procedure according to the first embodiment described hereinafter, it is possible to obtained more refined location estimates if the following data is available:

[0117] geographical map of the area served by the serving cell and/or

[0118] Statistical properties of the TA measurements.

[0119] In the following, the data needed for the algorithm and the data produced by the algorithm are described in short.

[0120] The input/additional information needed by the procedure is:

[0121] Input:

[0122] Cell Identity of the serving BTS: CI

[0123] Timing Advance from the serving BTS: TA

[0124] Confidence coefficient for the Timing Advance measurement: γ

[0125] Confidence coefficient for the location estimate: ξ

[0126] Additional Information available:

[0127] BTS coordinates

[0128] Serving cell maps

[0129] Percentile levels of the TA measurement error

[0130] The output of the algorithm is:

[0131] Output:

[0132] Estimate of the MS location: {circumflex over (x)},ŷ

[0133] Confidence region of the location estimate

[0134] The location algorithm partially relies on the statistical procedure to estimate the MS-to-serving BTS distance and its confidence level. This, however, is described later in the description. In the following, the different steps of the procedure for locating a mobile station according to the first embodiment is described by referring to the flow chart of FIG. 2.

[0135] 1. Select the coordinates of the serving BTS using the CI: x_(S),y_(S) (Step S1).

[0136] When the CI of the serving cell is given, the x-y coordinates of the cell identified by such CI, (x_(S),y_(S)), are retrieved from the database of BTS coordinates.

[0137] 2. Select the serving cell map: S (Step S2).

[0138] Analogously as in the previous step, the CI is used to select the serving map, S, corresponding to the current CI. S is typically determined by a network planning tool which uses a large set of information such as BTS configuration parameters, 3-dimensional terrain maps, tuned propagation models, etc. and, in order to determine the serving area, takes into account also the presence of other BTS's in the network. Such map consists of a set of coordinates pairs such that the cell identified by CI is serving in the region defined by such coordinates. An example of serving area is in FIG. 3.

[0139] 3. Determine the parameters of the constant-TA circular crown, C (Steps S3, S4):

[0140] First, the actual TA value is detected (step S3). Then, a region with the shape of a circular crown, C, (in the following referred to as constant-TA circular crown) around the BTS can be formed based on the TA (step S4).

[0141] In particular, the serving cell coordinates, TA and statistical properties of the TA measurement are used to define the constant-TA circular crown, C, where the MS location is situated with a certain confidence level, γ.

[0142] The constant-TA circular crown is depicted in FIG. 4; its mathematical definition in an arbitrary x-y reference system is:

C:{(x,y)εIR ² :R ₁≦{square root}{square root over ((x−x ₀)²+(y−y ₀)²)}≦R ₁ +R ₂}  (1)

[0143] where:

[0144] (x₀,y₀): coordinates of the origin;

[0145] R₁: inner radius; and

[0146] R₂: uncertainty radius.

[0147] It is noted that x₀ and y₀ correspond to the coordinates of the serving BTS. Furthermore, R₁ and R₂ are such that with probability γ the exact distance between MS and serving BTS, d, is within the interval [R₁, R₁+R₂]. That is, the uncertainty radius, R₂, describes the width of the so-called crown.

Pr(R ₁ ≦d≦R ₁ +R ₂)=γ  (2)

[0148] The uncertainty radius R₂ represents the uncertainty of the TA measurements. It is again noted that the TA value has 64 levels (in GSM) such that there are several steps, i.e., intervals.

[0149] The radii concerned, i.e., R₁ and R₂, can be provided beforehand in a corresponding database. However, these radii can also be calculated by exploiting the knowledge of the statistical properties of the TA measurements. Such a procedure will be described later on in the description. Nevertheless, a solution is already presented here. That is, according to the procedure mentioned above, R₁ and R₂ can be determined as follows:

R ₁ =d _(TA) −X _((1+γ)/2) ;R ₂ =X _((1+γ)/2) −X _((1−γ)/2)  (3)

[0150] where (T_(b)=3.69 μs is the bit period and c=3×10⁸ m/s is the speed of light), $d_{TA} = \left\{ \begin{matrix} {{{\frac{1}{4} \times \left( {{cTb}/2} \right)} \cong {138m{\quad \quad}{if}{\quad \quad}{TA}}} = 0} \\ {{{TA} \times \left( {{cTb}/2} \right)\quad {if}\quad {TA}} > 0} \end{matrix} \right.$

[0151] and X_((1±γ)/2) is the $100\frac{1 \pm \gamma}{2}\%$

[0152] percentile of the TA measurement error (see table 1, which is described later). Depending on the cases, the inner radius can be also zero.

[0153] 4. Estimate the MS location and its confidence region from the region I=S∩C (steps S5, S6).

[0154] The region S includes all possible locations of the MS's in communication with the cell identified by the CI. The region C includes the possible locations of the MS's which use the given TA while connected or attached with the BTS identified by the CI. The MS location is thus included in the intersection between S and C, that is I.

[0155] An example is shown in FIG. 5. A location estimate for the MS is illustrated in the figure in the intersection area of the constant-TA crown and the serving area S.

[0156] The most straightforward way to estimate the MS location is to determine the center point of the intersection area (I). This is illustrated in FIG. 5. A more detailed algorithm to determine the center point and its confidence region is proposed later in the description of the first embodiment (see equations (17) to (36)).

[0157] Summarizing, the location algorithm according to the first embodiments estimates the MS location coordinates as follows:

[0158] Input:

[0159] Cell Identity of the serving BTS: CI

[0160] Timing Advance from the serving BTS: TA

[0161] Confidence coefficient for the Timing Advance measurement: γ

[0162] Confidence coefficient for the location estimate: ξ

[0163] Additional Information available:

[0164] BTS coordinates

[0165] Serving cell maps

[0166] Percentile levels of the TA measurement error

[0167] Output:

[0168] Estimate of the MS location: {circumflex over (x)},ŷ

[0169] Confidence region of the location estimate

[0170] Algorithm:

[0171] 1. Select the corredinates of the serving BTS using the CI: x_(s), y_(s)

[0172] 2. Select the serving cell map: S

[0173] 3. Determine the parameters of the constant-TA circular crown C (see FIG. 4) $\quad\left\{ \begin{matrix} {{{{Origin}:x_{0}} = x_{s}};} & {{y_{0} = y_{s}}\quad} \\ {{{{Radii}:R_{1}} = {d_{TA} - X_{{({1 + \gamma})}/2}}};} & {R_{2} = {X_{{({1 + \gamma})}/2} - X_{{({1 - \gamma})}/2}}} \end{matrix} \right.$

[0174]  where $d_{TA} = \left\{ \begin{matrix} {{{\frac{1}{4} \times \left( {{cTb}/2} \right)} \cong {138m{\quad \quad}{if}{\quad \quad}{TA}}} = 0} \\ {{{TA} \times \left( {{cTb}/2} \right)\quad {if}\quad {TA}} > 0} \end{matrix} \right.$

[0175]  and X_((1±γ)/2) is the $100\frac{1 \pm \gamma}{2}\%$

[0176]  percentile of the TA measurement error (see table 1).

[0177] 4. Estimate the MS location and its confidence region from the region I=S∩C.

[0178] In the following, an implementation of the location technique according to the first embodiment is described with reference to FIG. 6. This implementation is called VELOCITA (VEctorial Location with CI-TA) hereinafter. The main elements thereof are:

[0179] NPS: Network Planning System

[0180] LMT: Location Management Tool

[0181] LS: Location Server

[0182] The connection with a Network Management System (NMS) is also shown; its role in the overall picture will be discussed later.

[0183] In the VELOCITA concept, the LMT receives BTS's coordinates and serving maps from the NPS. Tables containing the radii of the constant-TA circular crown, R₁ and R₂ (or alternatively, the TA error percentile levels) can be entered/updated by the user and they are stored in the LMT.

[0184] For each CI, the LMT selects the corresponding serving map and for each possible TA value (ranging from 0 to 63) generates a constant-TA circular crown by using the TA table. Afterwards, the LMT estimates the MS location and its confidence region from the intersection between serving map and constant-TA circular crown. The LMT determines also the confidence region associated to each location estimate. The LMT repeats this procedure for each cell and each TA value. The final result is a table for each CI where the location estimates/confidence regions corresponding to each TA are stored. Such tables are uploaded and stored in the LS.

[0185] In terms of the standardized Timing Advance procedure, the LS acts as SMLC as it receives the location requests and delivers the location estimates. When an external application sends to the LS the location request containing CI and TA, the LS picks the table corresponding to the correct CI; selects the row corresponding to the received TA and delivers to the external application the location estimate and the confidence region stored in such row.

[0186] It is noted that the LS is a very delicate element of the system. It must be very reliable and it must process as many location requests as possible in real time. For capacity reason, the amount of calculation carried out in the LS must then be kept very low. The VELOCITA concept accomplishes this task as the amount of calculation carried out in the LS is very limited. The majority of calculation power is required in the LMT that, on the other hand, does not need to produce the location estimates in real time.

[0187] In normal operational conditions the interaction between LMT and LS is limited to updating the location tables (location estimates and confidence regions). Only at the start-up of the system a large amount of data must be uploaded to the LS; in fact the LMT processes all the maps provided by the NPS and uploads them to the LS. After the system is “up and running” a mechanism should trigger the generation of (a limited set of) new location tables only when a change in the network parameters determines the generation of new serving maps in the NPS.

[0188] LS and LMT work in parallel; the location calculation is kept completely separated from the management of location requests; thus it does not affect the capacity of the system. For these reasons the VELOCITA concept provides a high reliability and high capacity implementation of the Timing Advance procedure.

[0189] Thus, according to the VELOCITA concept, the location estimates are calculated beforehand. That is, when a location request is received by the LS, the actual location estimate is looked up in a database table according to the actual CI and the actual TA. As described above, the LMT is the non-real time system calculating the location estimates and LS is the real time system responding to the location requests with location estimates from a look-up table. The location estimates calculated in the LMT are uploaded to the LS. The data needed for the calculation are obtained from the NPS or NMS.

[0190] The database mentioned above can also be separated in two relational databases or database tables: the CI level information may be stored in a first database table, whereas the TA level (location estimate and confidence area) information may be stored in a second database table. With a proper indexing of the table and a relation between the tables, a fast look-up of the location estimates is possible.

[0191] Next, further implementation issues are discussed.

[0192] As already mentioned, the algorithm is derived keeping the features of GSM system in mind however an extension to the UMTS system is possible. Of particular interest is the implementation of a WAP (Wireless Application Protocol) location system according to the VELOCITA concept in FIG. 6.

[0193] WAP phones will in fact send to the network CI and TA of the serving cell to allow location-based applications. The current view is that CI and TA will be sent to the LS, which in turns will deliver the MS location estimate.

[0194] The VELOCITA concept suits very well the need to have a reliable LS able to respond to a large amount of location requests in real time.

[0195] Performance of the location algorithm in terms of accuracy depends on correctness of network information and reliability of measurement models.

[0196] Regarding the Network Information, an implementation in a real environment requires the network information to be constantly updated. For what concerns BTS coordinates, CI and serving maps the connection with NPS should be in principle enough to meet this requirement. However, in many practical cases the information stored in NPS does not reflect accurately the current status of the network (sometimes operators change parameters in the network, add BTS's, re-home cells, etc. without updating the information in their NPS). For this reason, the connection with another element which contains more reliable network information such as a Network Management System (NMS) could be beneficial. This connection could be used for cross-checking CIs and/or BTS's coordinates stored in NPS and NMS and, eventually, alert the LS when an inconsistency is found.

[0197] Regarding the Measurement Models, the data stored in the TA table determines the TA measurement model used for location calculation purposes. This data depends on the environment and could also change with the time. Thus, in order to achieve satisfactory performance, it should be adjusted continuously.

[0198] In first implementations, it could be too complicated to adjust continuously the measurements models. However, an extensive campaign of TA measurements could be conducted in the network where the system is going to be installed and the TA measurement models derived off-line from a comparison between collected TAs and corresponding true MS-to-serving BTS distances.

[0199] In future implementations, the TA tables should be generated automatically. When location techniques other than the Timing Advance (for example E-OTD, stand-alone GPS or Assisted GPS) will be implemented, the E-BTD, GPS, etc. location estimates could be used to calculate the reference MS-to-serving BTS distance to be compared with the measured TA and the models updated automatically, perhaps on a cluster of cells/cell basis. If neither real-time nor non real-time models for the TA measurement error are available, the radii R₁ and R₂ can be calculated by considering only the TA quantization levels, as follows: $\begin{matrix} {{R\quad 1} = \left\{ \begin{matrix} {{0{\quad \quad}{if}\quad {TA}} = 0} \\ {{\left( {{TA}\frac{1}{2}} \right) \times \left( {{cTb}/2} \right){\quad \quad}{if}\quad {TA}} > 0} \end{matrix} \right.} \\ {{R\quad 2} = \left\{ \begin{matrix} {{{\frac{1}{2} \times \left( {{cTb}/2} \right)} \cong {277m\quad {if}\quad {TA}}} = 0} \\ {{{cTb}/2} \cong {550m{\quad \quad}{if}\quad {TA}} > 0} \end{matrix} \right.} \end{matrix}$

[0200] The location system should also provide a location estimate when a TA is not available. To this purpose, the LMT can add a line to the location table that is not associated to any TA value. The location estimate could be at the center point of the serving map and the confidence region could be a circle centered at the MS location estimate (R₁=0).

[0201] Thus, as mentioned above, according to the first embodiment, a location algorithm is proposed that can be implemented in the framework of the Timing Advance procedure standardized in the GSM specifications Release 1998 and 1999. The Mobile Station (MS) location is calculated by using information made available in the Serving Mobile Location Center (SMLC) by standardized GSM procedures, namely Cell Identity (CI) and Timing Advance (TA). In combination with CI and TA, the algorithm uses information on the statistical distribution of the TA measurement error and geographical maps of the area served by the network's cells. The MS location is calculated at the center point of a region determined by the intersection between the serving map and a circular crown defined by the TA. In conjunction with the location estimate, it is also possible to determine a confidence region for the location estimate.

[0202] Furthermore, according to the first embodiment, also an implementation of the location algorithm according to the VELOCITA (VEctorial Location with CI-TA) concept has been discussed. In this implementation scheme the location calculation function is executed not in real time and kept separated from the real time delivery of location estimates; resulting in a high-capacity and high-reliability scheme. It is again noted that this concept is also applicable for a WAP location server and possibly other “Stand-Alone SMLC”-servers.

[0203] Next, as an appendix to the description of the first embodiment, a more detailed determination of the Constant-TA Circular Crown is described, which can be used in the above-described first embodiment.

[0204] As described above, the TA is a measure of the absolute propagation delay between the MS and the serving BTS. If d_(BTS) is the distance between the MS and the serving BTS estimated by the serving BTS, the TA can be expressed according to the GSM specifications as follows: $\begin{matrix} \begin{matrix} {{{TA} = {{round}\left\{ \frac{d_{BTS}}{{cT}_{b}/2} \right\}}};} & {{TA} \in \left\lbrack {0 \div 63} \right\rbrack} \end{matrix} & (4) \end{matrix}$

[0205] wherein T_(b)=3.69 μs is the bit period and c=3×10⁸ m/s is the speed of light. The TA is a distance measurement quantized in steps of cT_(b)/2≅550 m. It is used for location purposes to estimate the distance of the MS to be located from the serving BTS. According to the quantization rule (4) represented in FIG. 7, the distance calculated from the TA, d_(TA), is defined as follows: $d_{TA} = \left\{ \begin{matrix} {{\frac{1}{4} \times \left( {{cT}_{b}/2} \right)} \cong {138m}} & {{{if}\quad {TA}} = 0} \\ {{TA} \times \left( {{cT}_{b}/2} \right)} & {{{if}\quad {TA}} > 0} \end{matrix} \right.$

[0206] d_(TA) is a measure of radial distance characterized by a measurement error, X:

X=d _(TA) −d  (6)

[0207] where d is the exact distance between MS and serving BTS. There are essentially three contributions-in the TA measurement error, X: the condition of Non-Line-Of-Sight (NLOS), the multipath affecting the wave propagation over the radio channel and the granularity error due to the finite measurement's resolution. The combined effect of these contributions can be seen from the typical experimental histogram of X illustrated in FIG. 8.

[0208] In the following, the above mentioned errors (i.e., NLOS error, multipath error and granularity error) are described in more detail.

[0209] The error of NLOS affects directly the estimation of the radial distance, d_(BTS), prior the quantization (see equation (4)), by making the estimate of the radial distance positively biased (i.e., d_(BTS)−d is generally positive). The effect of this bias is also present after the quantization, being the mean value of the TA measurement error positive. An example is illustrated in FIG. 8, wherein the mean value, μ_(x), is about 500 m.

[0210] Analogously as the NLOS contribution, the multipath propagation over the mobile radio channel affects the estimation of the radial distance, d_(BTS). It “spreads” the estimation error, yielding to some hundreds of meters standard deviations in the TA measurement error. In FIG. 8, the standard deviation, σ_(X), is about 450 m.

[0211] The granularity error is the effect of the finite TA resolution and is introduced by the “round” operation in equation (4). The granularity increases the variance of the TA measurement error, compared with the variance due to the multipath only. As a result, also the bias introduced by the NLOS error is decreased (e.g., in absence of multipath d_(BTS) would be greater than d due to the NLOS contribution only; but the quantization in (4) can round d_(BTS) to a value smaller than d, making the final TA measurement error negative: X_(min)≅−350 m in FIG. 8.

[0212] These considerations must be taken into account when using the TA for location purposes. In particular, the determination of the constant-TA circular crown of FIG. 4 relies on a definition of two radii, R₁ and R₂, such that with probability the exact distance between MS and serving BTS, d, is within the interval [R₁; R₁+R₂]: R₁ and R₁+R₂ can be calculated once an estimate of the MS-to-BTS distance, {circumflex over (d)}, and its confidence interval are available. The confidence interval of the distance estimate defines a confidence region in the x-y plane referred to as “constant-TA circular crown, C” in the algorithm according to the first embodiment.

[0213] The confidence region of the distance estimate, which is illustrated in FIG. 9, is a strip around the estimated distance defined by two radii (in general not equal), r_(i)>0 and r_(s)>0 such that the real MS-to-BTS distance, d, is in the interval [{circumflex over (d)}−r_(i),{circumflex over (d)}+r_(s)] in 100γ % of cases (γ is the confidence coefficient).

[0214] In the following the procedure to determine {circumflex over (d)}, r_(i) and r_(s) {circumflex over (d)} by taking into account the statistical properties of the TA measurement error is outlined: {circumflex over (d)}

[0215] 1. Given the measured TA value, consider the CDF of the TA measurement error for that particular value of TA (see FIG. 10).

[0216] 2. Calculate distance estimate and confidence interval by using the percentiles of the TA measurement error.

[0217] Referring to the simplified CFD in FIG. 10, let X=d_(TA)−d be the random variable defining the TA measurement error, F(X) the CDF of X and X_(p) the p-th percentile (0<p<1) of X (e.g. X_(p) is such that F(X_(p))=Pr(X≦X_(p))=100p %); then distance and confidence interval are determined as described below.

[0218] (a) Distance Estimate.

[0219] The estimated distance is calculated by adding to the TA measured a correction, TA_(c), such that the resulting distance estimate {circumflex over (d)}=d_(TA)+TA_(c) is the 50-th percentile (or median value) of the distance:

{circumflex over (d)}=d _(TA) +TA _(c) with TA _(c) such that Pr(d≦{circumflex over (d)})=50%  (7)

[0220] By observing that d=d_(TA)−X and {circumflex over (d)}=d_(TA)+TA_(c) the probability of interest becomes

Pr(d≦{circumflex over (d)})=Pr(d _(TA) −X≦d _(TA) +TA _(c))=Pr(−X≦TA _(c))=Pr(X≧−TA _(c))=1−Pr(X≦−TA _(c))=1−F(X=−TA _(c))

[0221] This results in: $\begin{matrix} \begin{matrix} {{\Pr \left( {d \leq \hat{d}} \right)} = {{1 - {F\left( {X = {- {TA}_{c}}} \right)}} = {1/2}}} \\ {{F\left( {X = {- {TA}_{c}}} \right)}{1/2}} \\  \Downarrow \\ {{TA}_{c} = {- X_{1/2}}} \end{matrix} & (8) \end{matrix}$

[0222] where X_(1/2) is the median of the TA measurement error.

[0223] (b) Confidence Interval for the Distance Estimate.

[0224] Given a confidence coefficient 0<γ<1, the confidence interval associated to the distance estimate, {circumflex over (d)}, is defined by the radii, r_(i)>0 and r_(s)>0, such that in the 100γ % of cases the true distance d falls within the interval [{circumflex over (d)}−r_(i),{circumflex over (d)}+r_(s)]. r_(i) and r_(s) are calculated by imposing that with equal probability d is inside the intervals [{circumflex over (d)}−r_(i),{circumflex over (d)}] or inside the interval [{circumflex over (d)},{circumflex over (d)}+r_(s)]: $\begin{matrix} \begin{matrix} {{\Pr \left( {{\hat{d} - r_{1}} \leq d \leq {\hat{d} + r_{s}}} \right)} = \gamma} & \left\{ \begin{matrix} {{\Pr \left( {{\hat{d} - r_{i}} \leq d \leq \hat{d}} \right)} = {\gamma/2}} \\ {{\Pr \left( {\hat{d} \leq d \leq {\hat{d} + r_{s}}} \right)} = {\gamma/2}} \end{matrix} \right. \end{matrix} & (9) \end{matrix}$

[0225] Again, by observing that d=d_(TA)−X and {circumflex over (d)}=d_(TA)+TA_(c) the, the probabilities of interest become $\begin{matrix} \left\{ \begin{matrix} {{\Pr \left( {{- {TA}_{c}} \leq X \leq {{- {TA}_{c}} + r_{i}}} \right)} = {\gamma/2}} \\ {{\Pr \left( {{{- {TA}_{c}} - r_{s}} \leq X \leq {- {TA}_{c}}} \right)} = {\gamma/2}} \end{matrix} \right. & (10) \end{matrix}$

[0226]FIG. 10 helps in writing the probabilities (10) as $\begin{matrix} \left\{ \begin{matrix} {{\Pr \left( {{- {TA}_{c}} \leq X \leq {{- {TA}_{c}} + r_{i}}} \right)} = {{\Pr \left( {X \leq {r_{i} - {TA}_{c}}} \right)} - {1/2}}} \\ {{\Pr \left( {{{- {TA}_{c}} - r_{x}} \leq X \leq {- {TA}}} \right)} = {{1/2} - {\Pr \left( {X \leq {{- {TA}} - r_{s}}} \right)}}} \end{matrix} \right. & (11) \end{matrix}$

[0227] By combining equations (10) and (11) r_(i) and r_(s) can be determined: $\begin{matrix} \left\{ \begin{matrix} {{F\left( {X = {{- {TA}_{c}} + r_{i}}} \right)} = {{1/2} + {\gamma/2}}} \\ {{F\left( {X = {{- {TA}_{c}} - r_{s}}} \right)} = {{1/2} - {\gamma/2}}} \end{matrix}\Downarrow \left\{ \begin{matrix} {{r_{i} = {{TA}_{c} + {X_{{({1 + \gamma})}/2}\quad {where}\quad X_{{({1 + \gamma})}/2}{\quad \quad}{is}\quad {the}\quad 100\frac{1 + \gamma}{2}{\sigma/0}\quad {{perc}.\quad {of}}\quad {TA}\quad {{meas}.{\quad \quad}{error}}}}}{\quad \quad}} \\ {r_{s} = {{- {TAc}} - {X_{{({1 - \gamma})}/2}\quad {where}\quad X_{{({1 + \gamma})}/2}\quad {is}\quad {the}\quad 100\frac{1 - \gamma}{2}{\sigma/0}\quad {{perc}.\quad {of}}{\quad \quad}{TA}\quad {{meas}.\quad {error}}}}} \end{matrix} \right. \right. & (12) \end{matrix}$

[0228] Considering that {circumflex over (d)}=d_(TA)+TA_(c), r_(i)=TA_(c)+X_((1+γ)/2) and r_(s)=−TA_(c)−X_((1−γ)/2), the confidence interval can be written equivalently as follows:

[{circumflex over (d)}−r _(i) ,{circumflex over (d)}+r _(s) ]⇄[d _(TA) −X _((1+γ)/2) ,d _(TA) −X _((1−γ)/2)]  (13)

[0229] The width of the confidence interval is

X _((1+γ)/2) −X _((1−γ)/2)  (14)

[0230] Using the notation of equation (2) equation (9) becomes

Pr({circumflex over (d)}−r_(i) ≦{circumflex over (d)}+r _(s))=Pr(R ₁ ≦d≦R ₁ +R ₂)=γ  (15)

where

R ₁ ={circumflex over (d)}−r _(i) =d _(TA) −X _((1+γ)/2) ;R ₂ =r _(s) +r _(i) =X _((1+γ)/2) −X _((1−γ)/2)  (16)

[0231] Percentile levels of the TA measurement error useful for the calculation of {circumflex over (d)} and of its confidence region are listed in table 1.

[0232] The procedure to calculate {circumflex over (d)} and its confidence region is summarized in the following example, in which the Distance Estimate and its Confidence Interval From a Timing Advance is determined by using the statistical properties of the TA Measurement Error. For exemplification purposes, few simulated percentiles of the TA measurement error (X) are collected in Table 1. TABLE 1 # of TA value samples 0.5% 5.0% 16.5% 50.0% 83.5% 95.0% 99.5% 0 70000 −2492.2 −175.5 −313.9 −8.3 45.3 69.7 127.7 1 70000 507.1 153.9 3.4 204.9 387.8 460.6 523.4 2 70000 279.9 115.5 26.8 342.3 647.9 842.2 1049.1 3 70000 316.9 24.7 192.2 524.0 852.9 1070.7 1302.9 . . . . . . . . . . . . . . . . . . . . . . . . . . . 63  70000 242.4 75.0 322.8 624.4 1056.5 1345.7 1785.1

[0233] The distance estimate is determined “with the 90% of confidence” (γ=0.9) when the measured timing advance (TA) is 2.

[0234] First, the distance estimate must be calculated as {circumflex over (d)}=d_(TA)+TA_(c). The equivalent in meters of the measured timing advance is d_(TA)≅2×553.8=1107 meters. TA_(c) is the median value of the TA measurement error when TA=2 (see equation (8)) changed of sign. From table 1, the median value of the TA measurement error when TA=2, is X_(1/2)≅342 m yielding to a correction of TA_(c)=−342 m and a distance estimate of

{circumflex over (d)}=1107−342=765 m

[0235] The percentiles of the TA measurement errors needed to calculate the confidence interval are 100 (1−γ)/2=5% and the 100(1+γ)/2=95%. They can be found in table 1: X_((1−γ)/2)=X_(5%)=−115 m and X_((1+γ)/2)=X_(95%)=842 m. The extremes of the confidence interval are d_(TA)−X_(95%)=1107−842=265 m and d_(TA)−X_(5%)=1107+115=1222 m resulting in the confidence interval:

[0236] [265;1222] m

[0237] As a result of a non-symmetric distribution of the TA measurement error, the distance estimate {circumflex over (d)}=765 m is not in the middle of the confidence interval (765−265=500 m; 1222−756=466 m).

[0238] Next, as a further appendix to the first embodiment, a procedure for calculating the Center Point and Its Confidence Region is described. In particular, the location of the MS is estimated as the center point of the region I=S∩C, i.e., the center point of the intersection area of the serving area and the constant-TA crown, as defined above.

[0239] The procedure requires the following input:

[0240] The region I can be considered as being defined through a bitmap of pixels in an arbitrary x-y Cartesian system:

I:{x _(m) ,y _(n) }; m=1, . . . , M n=1, . . . , N  (17)

[0241] Coordinates of the serving BTS: x_(s), y_(s)

[0242] The center point of I has coordinates (x_(CP);y_(CP)) which are calculated as follows.

[0243] 1. Conversion of the pixels coordinates in a polar coordinates: (x_(m), y_(n))→(ρ_(mn), θ_(mn)).

[0244] The polar reference system (ρ, θ) is originated in the serving BTS of coordinates (x_(s), y_(s)). ρ_(mn) is the distance between the pixel of coordinates (x_(m), y_(n)) and the serving BTS. θ_(mn) is the angle associated to the same pixel measured counterclockwise from the x axis (refer to FIG. 11). $\begin{matrix} \begin{matrix} {{\rho_{mn} = \sqrt{\left( {x_{x} - x_{m}} \right)^{2} + \left( {y_{x} - y_{n}} \right)^{2}}};} & {\theta_{mn} = {\tan^{- 1}\frac{y_{s} - y_{n}}{x_{x} - x_{m}}}} \end{matrix} & (18) \end{matrix}$

[0245] 2. Determination of the deviation of the pixels's angular coordinates θ_(mn) from a given reference angle, θ_(R). The deviation is indicated in the following with δ_(mn).

[0246] The reference direction θ_(R) provides an indication of the serving sector's bearing. If the BTS antenna bearing is available then θ_(R) should assume that value. If the exact information on the antenna is not available, a suitable definition for θ_(R) is the median value of a plurality of angles θ_(mn)'s:

θ_(R)=median{θ_(mn)}  (19)

[0247] The deviation of the pixels's angular coordinates from θ_(R) is simply defined as (see FIG. 11):

δ_(mn)=θ_(mn)−θ_(R)  (20)

[0248] 3. Determination of the radial coordinate and angular deviation of the center point: (ρ_(CP);δ_(CP))

[0249] The radial coordinate of the center point and its angular deviation from the reference direction θ_(R) can be determined as the median value of ρ_(mn)'s and θ_(mn)'s respectively:

ρCP=median{ρ_(mn)}; δCP=median{δ_(mn})  (21)

[0250] 4. Conversion of polar coordinates of the center point in x-y coordinates: (x_(CP), y_(CP)).

[0251] The center point's orientation in the (ρ, θ) reference system is calculated according to equation (20):

θCP=δCP+θ_(R)  (22)

[0252] The x-y coordinates of the center point are calculated according to the definition (18):

x CP=x _(s)+ρCP cos(θCP); y CP =y _(s)+ρCP sin(θCP)  (23)

[0253] Next, an example of Center Point Calculation is given:

[0254] Results obtained with the algorithm proposed above are provided in FIG. 12. A simple serving cell is defined by the union of a triangle and a trapezium (FIG. 12a). The BTS site is located at the origin of an arbitrary x-y reference system. The BTS antenna bearing measured with the same convention as θ is 90° but, for illustration purposes, its value is assumed unknown and the reference angle is calculated according to equation (19).

[0255] In FIGS. 14b-12 f the dots represent the pixels inside the region I for different Timing Advance values (the dimensional unit is arbitrary). The center point is calculated according to the procedure described by equations (18)-(23). Its location is represented by the circle within the region of the dots in each of the FIGS. 14b to 14f, respectively. The need of a reference direction θ_(R) is stressed by providing the results obtained without using any information on the “cell orientation”, i.e. by assuming θ_(R)=0 (the location of the center point in this case is represented by an asterisks in the Figs.).

[0256] If a reference direction is not used (i.e., if θ_(R)=0) θ_(CP)=δ_(CP) is simply the median value of the θ_(mn)'s. In the example examined angles are measured with the convention −π≦θ_(mn)≦−π. Thus in the case of FIG. 12b, for instance, the pixels with −π≦θ_(mn)≦−π/2 and the pixels with π/2≦θ_(mn)≦π cancel out and only the pixels with 0≦θ_(mn)≦π/2 determine the (wrong) direction of the center point.

[0257] Determination of the Confidence Region

[0258] The confidence region R should be determined from the following definition (for simplicity continuous random variables are used instead of ρ_(mn) and θ_(mn)): $\begin{matrix} {{\Pr \left( {\left( {\rho,\delta} \right) \in \quad R} \right)} = {{\int{\int_{R}{{f_{\rho\delta}\left( {\rho,\delta} \right)}{\rho}{\delta}}}} = \xi}} & (24) \end{matrix}$

[0259] being ξ the required confidence coefficient and ƒ_(ρδ)(ρ,δ) the joint probability density function (PDF) of the pixels' radial coordinate and angular deviation from θ_(R).

[0260] To derive ƒ_(ρδ)(ρ,δ) can be very complicated if not impossible. Thus, the PDF can be approximated inorder to determine R. For such an approximated procedure, it is assumed that δ and ρ are independent random variables. Under such an assumption ƒ_(ρδ)(ρ,δ) is the product of the marginal distributions ƒ_(ρ)(ρ), ƒ_(δ)(δ) and the definition (24) simplifies as follows: $\begin{matrix} {{{\Pr \left( {\left( {\rho,\delta} \right) \in \quad R} \right)} \cong {\int{\int_{R}{{f_{\rho}(\rho)}{f_{\delta}(\delta)}{\rho}{\delta}}}}} = \xi} & (25) \end{matrix}$

[0261] Since the center point is determined from the region I, intersection of the serving area S and the constant-TA circular crown C, it is convenient to determine the confidence region R as a subregion of C. The radial borders of R are the same as C; the angular width is determined by using the angular distribution of pixels in I.

[0262] C can be expressed in (ρ, δ) coordinates as:

C:{(ρ,δ):R ₁ ≦ρ≦R ₁ +R ₂;0≦δ<2π}  (26)

[0263] and it is such that $\begin{matrix} {{\Pr \left( {{{R1} \leq \rho \leq {{R1} + {R2}}};{0 \leq \delta < {2\pi}}} \right)} = {{\int_{R1}^{{R1} + {R2}}{{f_{\rho}(\rho)}\quad {\rho}{\int_{0}^{2\pi}{{f_{\delta}(\delta)}\quad {\delta}}}}} = {{\int_{R1}^{{R1} + {R2}}{{f_{\rho}(\rho)}\quad {\rho}}} = \gamma}}} & (27) \end{matrix}$

[0264] It is then possible to define the confidence region R in (ρ, δ) coordinates as

C:{(ρ,δ):R ₁ ≦ρ≦R ₁ +R ₂;δ₁≦δ≦δ₂}  (28)

[0265] where δ₁ and δ₂ can be obtained from (25) after substitution of (27): $\begin{matrix} {{\Pr \left( {\delta_{1} \leq \delta \leq \delta_{2}} \right)} = {{\int_{\delta 1}^{\delta 2}{{f_{\delta}(\delta)}\quad {\delta}}} = {\xi/\gamma}}} & (29) \end{matrix}$

[0266] R so defined has the shape of a circular crown with same origin and radial bounds as C but different angular width.

[0267] In absence of other information ƒ_(ρ)(ρ) can be approximated with the distribution of δ_(mn)'s determined in equation (20) and δ₁, δ₂ calculated as the (1−ξ/γ)/2-th, (1+ξ/γ)/2-th percentile levels respectively: $\begin{matrix} {{\Pr \left( {{\delta 1} \leq \delta \leq {\delta 2}} \right)} = {{\xi/\gamma}\left\{ \begin{matrix} {{\Pr \left( {\delta \leq \delta_{1}} \right)} = {\left( {1 - {\xi/\gamma}} \right)/2}} \\ {{{PR}\left( {\delta \leq {\delta 2}} \right)} = {\left( {1 + {\xi/\gamma}} \right)/2}} \end{matrix} \right.}} & (30) \end{matrix}$

[0268] The discussion above is the background for the procedure to determine the confidence area of the location estimate, which is summarized in the following:

[0269] Input

[0270] Required confidence coefficient for the location estimate: ξ

[0271] Confidence coefficient associated to the constant-TA circular crown: γ

[0272] Distribution of the angular deviations: {δ_(mn)}

[0273] It is noted that for the above coefficients, it must be 0<ξ<δ<1.

[0274] The confidence region of the center point is represented in FIG. 13 and characterized by the following parameters:

[0275] origin located at point with coordinates (x₀;y₀)

[0276] inner radius, R₁

[0277] uncertainty radius, R₂

[0278] inclusion angle defining the width of the sector, β

[0279] orientation angle measured counterclockwise from x axis, α

[0280] The confidence region's parameters are derived as described in the following.

[0281] 1. Sort the δ_(mn)'s: $\begin{matrix} {\left\{ \delta_{l} \right\}_{l = 1}^{M \times N} = {{sort}\quad \left\{ \delta_{m\quad n} \right\}}} & (31) \end{matrix}$

[0282] 2. Determine δ₁ and δ₂

[0283] δ₁ and δ₂ are the (1−4/γ)/2-th and (1+ξ/γ)/2-th percentile levels of the δ₁'s: $\begin{matrix} {\delta_{1} = {\delta_{1}_{l = {\lfloor{{({M \times N})}{(\frac{1 - {\xi/\gamma}}{2})}}\rfloor}}}} & (32) \\ {{\delta 2} = {\delta_{1}_{l = {\lceil{{({M \times N})}{(\frac{1 + {\xi/\gamma}}{2})}}\rceil}}}} & (33) \end{matrix}$

[0284] where

rounds • to the nearest integer towards minus infinity (floor operation) and

rounds • to the nearest integer towards infinity (ceil operation).

[0285] 3. Determine the angular width of the confidence region: β.

[0286] β is the total angular width spanned by δ₁ and δ₂. Assuming for simplicity, 0≦δ₁, δ₂<2π, it results

β=δ₂−δ₁  (34)

[0287] 4. Determine the orientation of the confidence region: α.

[0288] α is the angle measured in the (ρ, θ) system corresponding to the smallest angular deviation, δ₁:

α=θ_(R)+δ₁  (35)

[0289] 5. Determine the origin of the confidence region: (x₀, y₀).

[0290] The confidence region has origin in the serving BTS coordinates:

x₀=x_(S)

y₀=y_(S)  (36)

[0291] 6. Determine inner radius and uncertainty radius: R₁, R₂.

[0292] R1 and R2 are the same radii that characterize the constant-TA circular crown C, as shown in FIG. 4 and used in equations (1) to (3).

[0293] Second Embodiment

[0294] According to the first embodiment, the procedure to locate Mobile Stations (MS's) uses Cell Identity (CI), Timing Advance (TA), radio coverage data and statistical models for the TA measurement. The procedure according to the first embodiment uses only information related with the serving Base Transceiver Station (BTS).

[0295] However, according to the second embodiment described in the following, an extension of the procedure of the first embodiment is used, which includes in the location calculation the hearability area of neighbor BTS's measured by the MS to be located.

[0296] According to the first embodiment, the location algorithm is also implemented according to the VELOCITA (VEctorial LOcation with CI-TA) concept. The extension proposed in this embodiment can also be used in such implementation.

[0297] According to the second embodiment, the hearability area of the neighbor BTS's is in particular used. In this context, such areas designate the geographical locations where the broadcast signal radiated from a certain BTS can be received with a level that is above the sensitivity level of the handset. Hearability areas can be retrieved from the same network planning system that supports the implementation of the location procedure according to the first embodiment. In the GSM system, the identity of the neighbor BTS's which the MS is measuring can be obtained from the measurement reports (layer 3 messages) sent by the MS to the serving BTS. Such messages include, among other information, BSIC (Base Station Identity Code), BCCH carrier number and signal strength (RXLEV) measured by the MS on the BCCH frequency of the neighbor BTS's.

[0298] The location procedure according to the first embodiment can be extended by assuming that the following information is available:

[0299] Input:

[0300] Cell Identity of the serving BTS: CI

[0301] Timing Advance from the serving BTS: TA

[0302] Confidence coefficient for the Timing Advance measurement: γ

[0303] Confidence coefficient for the location estimate: ξ

[0304] Identity of the N neighbour BTS's measured by the MS: {NI₁, . . . , NI_(N)}.

[0305] In addition, the neighbor BTS's may be ordered in order of level intensity, i.e. NI₁ is the BTS with the highest received level and NIN is the BTS with the lowest received level. In practise, each of the identiy codes {NI₁, . . . , NI_(N)} is made of a pair BSIC (Base Station Identity Code)+Carrier decoded by the MS when measuring. the BCCH frequency of neighbor BTS's.

[0306] Additional Information available:

[0307] BTS coordinates

[0308] Serving cell maps

[0309] Percentile levels of the TA measurement error

[0310] Hearability areas of the neighbor BTS's measured by the MS: {H₁, . . . , H_(N)}.

[0311] The hearability area H_(i) of the i-th neighbor BTS identified by the identity code NI_(i) can be defined as follows:

H _(i):{(x,y)εIR ² :RXLEV _(i)(x,y)≦p}  (37)

[0312] where RXLEV_(i)(x, y) is the signal strength measured by the MS on the BCCH (Broadcast Common Control Channel) frequency of the i-th BTS and p is the sensitivity level of the MS.

[0313] The output of the algorithm is

[0314] Output:

[0315] Estimate of the MS location: {circumflex over (x)},ŷ

[0316] Confidence region of the location estimate

[0317] The first three steps of the location algorithm are the same as in the first embodiment, but the fourth step includes the location information derived from {H₁, . . . , H_(N)}.

[0318] 1. Select the coordinates of the serving BTS using the CI: x_(S), y_(S)

[0319] 2. Select the serving cell map: S

[0320] 3. Determine the parameters of the constant-TA circular crown, C: $\begin{matrix} {{C\text{:}\left\{ {\left( {x,y} \right) \in {{IR}^{2}:{R_{1} \leq \sqrt{\left( {x - x_{o}} \right)^{2} + \left( {y - y_{0}} \right)^{2}} \leq {R_{1} + R_{2}}}}} \right\}}\left\{ \begin{matrix} {{{{{Origin}\text{:}\quad x_{0}} = x_{s}};}} & {{y_{0} = y_{s}}} \\ {{{{{Radii}\text{:}\quad R_{1}} = {d_{TA} - X_{{({1 + \gamma})}/2}}};}} & {{R_{2} = {X_{{({1 + \gamma})}/2} - X_{{({1 - \gamma})}/2}}}} \end{matrix} \right.} & (1) \end{matrix}$

[0321] where $d_{TA} = \left\{ \begin{matrix} {{{\frac{1}{4} \times \left( {{cT}_{b}/2} \right)} \cong {138m}}} & {{{if}\quad {TA}} = 0} \\ {{{TA} \times \left( {{cT}_{b}/2} \right)}} & {{{if}\quad {TA}} > 0} \end{matrix} \right.$

[0322] and X_((1+γ)/2) is the $100\frac{1 \pm \gamma}{2}\%$

[0323] percentile of the TA measurement error.

[0324] 4. Estimate the MS location and its confidence region from the region: $I = {S\bigcap C\overset{N}{\bigcap\limits_{i = 1}}H_{i}}$

[0325] The serving cell map S includes all the possible locations of a MS in communication with the cell identified by the CI.

[0326] The constant-TA circular crown C includes the possible locations of a MS which uses the given TA while connected or attached with the BTS identified by the CI.

[0327] The hearability areas H_(i)(i=1, . . . , N) define the geographical regions where the BCCH frequencies radiated by the BTS's identified by NI_(i)(i=1, . . . , N) reach the handsets with a signal strength that is above the MS sensitivity level.

[0328] The MS location is thus included in the intersection I between S, C and H₁, . . . , H_(N). For generality, all the N neighbor BTS's are considered in the algorithm. However the procedure can also use only a subset of neigbor BTS's. Moreover, the neighbor BTS's can be ordered according to the received signal strength.

[0329]FIG. 14, for example, represents a case where I is determined by the intersection between the serving area S, the constant-TA circular crown C and the hearability area H₁ (illustrated by the sketched line) of the first neighbor BTS only.

[0330] The MS location ({circumflex over (x)},ŷ) and the confidence region R (such that the MS is inside R with probability ξ) can be determined with the same algorithm according to first embodiment.

[0331] It is noted that in GSM, the number of neighbor cells is six. However, in order to limit the complexity, it is advantageous to keep N low (e.g., N=1÷2). In this manner, only the most relevant information is used. For example, only the one or two neighbor BTS's may be used which have the highest signal strength.

[0332] Thus, the use of hearability area of neighbor BTS's according to the second embodiment improves the location accuracy by reducing the size of the uncertainty area where the MS can be located.

[0333] Furthermore, the introduction of hearability areas in a location algorithm originally conceived as a CI-TA procedure allows to use valuable coverage information of neighbor BTS's.

[0334] Moreover, the implementation of the location procedure according to the VELOCITA concept (i.e., location calculation performed not in real time as according to the first embodiment) is still possible if additional memory is used to store the location estimate tables generated in the LMT. On the other hand, if RXLEV measurements were used, real time location calculation would be necessary.

[0335] In addition, the need for real time calculation power is minimal. That is, as in the case of the first embodiment, most calculations can be performed beforehand and can be stored in a database (look-up table), such that the corresponding values can be retrieved from the database instead of calculating in real-time. Hence, the above procedure according to the second embodiment is suitable for mass locating, i.e., for locating a large number of users.

[0336] As a modification of the above described second embodiment, a location estimate can also be determined based only on the hearability areas. That is, an intersection area is formed from all hearability areas which can be received by the mobile station. In this way, it is not necessary to also detect the constant-TA crown and the map of the cell. In case a sufficient high number of surrounding BTS is present, an suitable accurate location estimate can be obtained.

[0337] Third Embodiment

[0338] In the following, a third embodiment is described in which Cell Identity (CI), Timing Advance (TA) and strength of received Signals with radio coverage information are used to locate mobile stations.

[0339] In the GSM system, the identity of the i-th neighbor BTS, NI_(i), used in the second embodiment can be obtained in practice from the pair of parameters BSIC (Base Station Identity Code)+BCCH Carrier included by the MS in the normal measurement reports (layer 3 messages) sent to the serving BTS.

[0340] Measurement reports include, among other information, also the signal strength (RXLEV) measured by the MS on the BCCH frequency of the neighbor BTS's. This information can be used to refine further the procedure according to the second embodiment, in the sense that the contribution of the neighbor cells in the location calculation can be extended to include, beside the identity of neighbor cells (i.e. hearability areas), also the actual strength of signals measured by the MS.

[0341] The basic idea of the procedure proposed in this document is to determine the region I as intersection of

[0342] 1. Serving area, S.

[0343] 2. Constant-TA circular crown, C.

[0344] 3. Coverage areas of the N neighbour BTS'S, {N1, . . . , N_(N)}.

[0345] The coverage area of the i-th neighbour, N_(i), identifies the geographical region where the broadcast channel radiated by the BTS identified by the i-th “identity code”, NI_(i), reaches the MS with a signal strength that is the one measured by the MS.

[0346] The coverage area of the i-th neighbor BTS N_(i) when the MS measures a signal strength of RXLEV_(i) ^((m)) can be defined as follows:

N _(i)(RXLEV _(i) ^((m))):{(x,y)εIR ² :RXLEV _(i) ^((p))(x,y)≦RXLEV _(i) ^((m))+Δ_(i)}  (39)

[0347] where RXLEV_(i) ^((p)) is the signal strength predicted for the BCCH frequency of the i-th BTS when the MS is at the location of coordinates (x, y) and Δ_(i)>0. Δ_(i) takes into account the fluctuations which usually affect RXLEV measurements. A reasonable value for Δ_(i) could be 6÷10 dB.

[0348] In alternative to the coverage area defined in (38) a coverage crown can be used to determine I.

[0349] Such a region is defined by using an interval of extremes RXLEV_(i) ^((m))±Δ, instead of RXLEV_(i) ^((m))+Δ_(i):

N _(i)(RXLEV _(i) ^((m))):{(x,y)εIR ² :RXLEV _(i) ^((m))−Δ_(i) ≦RXLEV _(i) ^((p))(x,y)≦RXLEV _(i) ^((m))+Δ_(i)}  (39)

[0350] In equation (39), the fluctuations affecting the measured RXLEV are accounted for, as in equation (38), but regions where the predicted RXLEV is much higher than the actual measured level are excluded from I.

[0351] The hearability area is a coverage area defined as in equation (38) when RXLEV_(i) ^((m))+Δ_(i) is equal to the MS sensitivity level. Since in general, the further the MS is from the BTS, the lower the signal strength is, the herability area for a certain BTS include all coverage areas (crowns) defined for measured RXLEVs higher than the MS sensitivity level. For this reason, the coverage area (crown) of a certain BTS is in general less extended than its herability area; thus the region I determined from coverage areas (crowns) is in general smaller than the one calculated by using hearability areas. As final result the location accuracy improves.

[0352] The location calculation can be carried out exactly as described in the second embodiment, after substituting the hearability areas H_(i)'s with the coverage areas (crowns) defined in equation (38) or (39).

[0353] The location calculation based on RXLEVs (the hearability area of a certain BTS is in practice one special coverage area) according to the third embodiment can also be implemented in the VELOCITA framework described in the first embodiment. It has to be noted that the location tables grow in size. This is because the MS measures up to six RXLEVs ranging from −48 dBm to −110 dBm with a resolution of 1 dBm. This means that if coverage areas (crowns) for all possible cells in the network and for all possible RXLEVs were used, the size of location tables generated in the VELOCITA framework would have to be large. In practice however there is no need to consider neither all the measured neighbors nor all possible RXLEV values; in fact, the growth in terms of size of the data structure would not be paid back by a comparable increase in location accuracy. For this reason, in a practical implementation, few neighbors (e.g., N=1÷2) and few values of RXLEV (e.g., −90 dBm, −80 dBm, −70 dBm, depending on the average signal level in the area considered) could be considered.

[0354] In a practical implementation, the planning tool (.e., the LMT) can supply (for a given cell) several coverage areas with different signal levels, e.g., one at −70 dBm, one at −80 dBm, one at −90 dBm and one at the sensitivity level −100 dBm (i.e., the hearability area).

[0355] This is illustrated in FIG. 15. In contrast to FIG. 14, here not only the hearablity area of the first neighbor BTS is shown, but also coverage areas with different signal levels, namely −100 dBm (respresented by the sketched line) and −90 dBm (represented by the dotted line). As derivable from FIG. 15, the estimated location is between the −90 dBm and the −100 dBm lines. That is, the intersection area I, and therefore the uncertainty, is smaller.

[0356] Thus, by the procedure according to the third embodiment, i.e., the use of neighbor's coverage areas (crowns), the location accuracy is improved, because the size of the uncertainty area where the MS can be located is reduced.

[0357] Furthermore, the implementation of the location procedure according to the VELOCITA concept (i.e., location calculation performed not in real time) is possible if additional memory is used to store the location estimate tables generated in the LMT.

[0358] Hence, the need for real time calculation power is minimal and thus, the procedure according to the third embodiment is suitable for locating a huge number of mobile stations.

[0359] The third embodiment can be modified similar to the modification of the above described second embodiment. That is, a location estimate can also be determined based only on the hearability areas. That is, an intersection area is formed from all hearability areas which can be received by the mobile station. In this way, it is not necessary to also detect the constant-TA crown and the map of the cell. In case a sufficient high number of surrounding BTS is present, an suitable accurate location estimate can be obtained, in particular when considering different signal levels.

[0360] Fourth Embodiment

[0361] As already described above, the distance between the mobile station and the serving base station BTS can be estimated by the Timing Advance (TA):

d≅TA×(cT _(b)/2)  (40)

[0362] where T_(b)=3.69 μs is the bit period, c=3×10⁸ m/s is the speed of light, and TA is an integer ranging from 0 to 63.

[0363] According to the fourth embodiment, it is also taken into account that cells may be sectored. Using the Cell Identity (CI), the sector of the serving cell can be determined. Using TA the distance d can be estimated. Combining these two, an arc can be determined inside which the mobile station should be located. The location estimate can be e.g. the mass center of the arc, as illustrated in FIG. 16.

[0364] In the case when only CI is known (no TA), the location estimate can be just the mass center of the whole cell (see FIG. 17). When the cell is omnidirectional, the best guess would be just the serving base station coordinates.

[0365] When CI and TA are used for location, the location accuracy is limited by the sector angular width and distance estimation reliability. In GSM the resolution of TA is 1 bit, which means that the distance d can be estimated with the resolution of 550 meters. In practice this means that CI+TA location accuracy varies with cell size, and is generally not very good.

[0366] According to the fourth embodiment, the location accuracy with CI or CI+TA procedure is improved by using external information about the probability density of mobile subscriber locations is used. In other words, when the location estimate is calculated from a coverage area of a cell (CI) or from an arc (CI+TA), this location estimate is calculated as a weighted mass center of the cell, i.e., the coverage area of the cell. The weights for each point reflect the probability of a subscriber being there.

[0367] Some possible sources for the user density distribution are:

[0368] Empirical user density studies, e.g. with some other location procedures more exact distribution of mobile users has been measured. For example, in standardized GSM location systems the Serving Mobile Location Center (SMLC) can collect statistics of location estimates obtained using more accurate GPS and E-OTD procedures. Such statistics can be used to form periodically the probability density of users inside each cell.

[0369] Geographical information is used. For example some part of the cell coverage area might be sea or a lake, where it is less likely that a user is situated (see FIG. 18).

[0370] Information about population density (e.g. offices, apartment buildings). An example is shown in FIG. 19. In this example, the probability that a user is located in the suburb on the right side of the cell is much higher than in the forest on the left side.

[0371] Information about roads, traffic densities, etc. This is illustrated in FIG. 20. Here, the probability that a user is located on the highway is very high, whereas the probability that he is located on a local road or in regions without roads (as on the left side) is rather low.

[0372] It is noted that the above information may change with time. That is, in particular the population density may change, such that the above information should be updated from time to time. This can be done as a non-real time process such that this will not decrease the location capacity.

[0373] By the above described procedure according to the fourth embodiment, the accuracy is improved. Furthermore, the implementation can be done using only software, such that no costly new hardware is required. In particular, no amendments to the mobile stations are required. That is, since the CI+TA procedure can be applied to existing mobiles, also the proposed improvement is applicable to all mobiles.

[0374] In the following, the mathematical formulation of the Location Algorithms according to the fourth embodiment is given.

[0375] Firstly, background information for the location algorithms according to the fourth embodiment are provided. More details can be found in A. Papoulis: “Probability, Random Variables, and Stochastic Processes” (3^(rd) Ed., McGraw-Hill, 1991).

[0376] The most simple way to state a parameter estimation problem is the following: we wish to estimates the value of a random variable Y by means of a constant c, which minimizes the Average Risk AR defined as follows:

AR=E{L(Y−c)}  (41)

[0377] L(x) is called Loss Function. After introducing the probability density function of Y, f_(y)(y), AR can be expressed as follows: $\begin{matrix} {{AR} = {{E\left\{ {L\left( {Y - c} \right)} \right\}} = {\int_{- \infty}^{+ \infty}{{L\left( {y - c} \right)}{f_{y}(y)}{y}}}}} & (42) \end{matrix}$

[0378] L(x) is chosen on the basis of the application. In the present embodiment two alternatives are considered: L(x)=x² and L(x)=|x|.

[0379] First, the alternative is considered in which the Loss Function is: L(x)=x².

[0380] If L(x)=x², c is the mean square estimate of Y , which is

c=E{Y}  (43)

[0381] This is proved in the following. The average risk AR is $\begin{matrix} {{AR} = {{E\left\{ \left( {Y - c} \right)^{2} \right\}} = {\int_{- \infty}^{+ \infty}{\left( {y - c} \right)^{2}{f_{y}(y)}{y}}}}} & (44) \end{matrix}$

[0382] Differentiating with respect to c results in $\begin{matrix} \begin{matrix} {\frac{{AR}}{c} = {{- 2}{\int_{- \infty}^{+ \infty}{\left( {y - c} \right){f_{y}(y)}{y}}}}} \\ {= {{{- 2}{\int_{- \infty}^{+ \infty}{{{yf}_{y}(y)}{y}}}} + {2{\int_{- \infty}^{+ \infty}{{{cf}_{y}(y)}{y}}}}}} \end{matrix} & (45) \end{matrix}$

[0383] Thus AR is minimum if $\begin{matrix} {c = {{\int_{- \infty}^{+ \infty}{{{yf}_{y}(y)}{y}}} = {E\left\{ Y \right\}}}} & (46) \end{matrix}$

[0384] Now, the alternative is considered in which the Loss Function is: L(x)=|x|.

[0385] If L(x)=|x|, c which is the median of Y, which is

c=median{Y}  (47)

[0386] This is proved in the following: The average risk AR is $\begin{matrix} \begin{matrix} {{AR} = {E\left\{ {{Y - c}} \right\}}} \\ {= {\int_{- \infty}^{+ \infty}{{{y - c}}{f_{y}(y)}{y}}}} \\ {= {{\int_{- \infty}^{c}{\left( {c - y} \right){f_{y}(y)}{y}}} + {\int_{c}^{+ \infty}{\left( {y - c} \right){f_{y}(y)}{y}}}}} \end{matrix} & (48) \end{matrix}$

[0387] Differentiating with respect to c results in $\begin{matrix} {\frac{{AR}}{c} = {{{\int_{- \infty}^{c}{{f_{y}(y)}{y}}} - {\int_{c}^{+ \infty}{{f_{y}(y)}{y}}}} = {{2{F_{y}(c)}} - 1}}} & (49) \end{matrix}$

[0388] where Fy is the cumulative density function (CDF) of the random variable Y. Thus R is minimum if Fy(c)=½, which means that c is the median value of Y.

[0389] The estimation problem formulated above is referred to as the classical estimation problem. The estimation is performed solely on the basis of the priori density f_(y)(y) of the unknown random variable. In certain applications it is possible to perform measurements (observations) on a certain random variable X which is somehow related to Y. In such cases the estimation of Y can be done by using the so-called posterior (after the observation) distribution of Y:f_(y|x)(y|x). The average risk is defined as $\begin{matrix} {{AR} = {{E\left\{ {L\left( {Y - c} \right)} \middle| X \right\}} = {\int_{- \infty}^{+ \infty}{{L\left( {y - c} \right)}{f_{y|x}\left( y \middle| X \right)}{y}}}}} & (50) \end{matrix}$

[0390] and the estimate for Y is constant c which minimizes the average risk.

[0391] The constant c can be determined with calculation similar to the ones which led to (43) and (47); its definition changes according to the choice for the loss function, L(x).

[0392] If the loss function is given as L(x)=x², c is the expected value of Y given the observation X:

c=E{Y|X}  (51)

[0393] If the loss function is given as L(x)=|x|, c is the median value of Y given the observation X:

c=median{Y|X}  (52)

[0394] Next, the basic geometry of the problem is described by referring to FIG. 21. MS and serving BTS have coordinates (x, y) and (x_(s), y_(s)) in the (arbitrary) x-y Cartesian reference system represented in the lower right corner of the figure. The distance between mobile and serving BTS is

ρ(x,y)={square root}{square root over ((x _(s) −x)²+(y _(s) −y)²)}  (53)

[0395] The Angle Of Arrival of the signal received by the mobile is $\begin{matrix} {{\theta \left( {x,y} \right)} = {\tan^{- 1}\frac{y_{s} - y}{x_{s} - x}}} & (54) \end{matrix}$

[0396] It results moreover: $\begin{matrix} \left\{ \begin{matrix} {x = {x_{s} + {\rho \quad {\cos (\theta)}}}} \\ {y = {y_{s} + {\rho \quad {\sin (\theta)}}}} \end{matrix} \right. & (55) \end{matrix}$

[0397] ρ and θ determine a polar reference system which is completely defined once the coordinates of the serving BTS are fixed in the Cartesian reference system (x, y).

[0398] In FIG. 21 also the bearing of the antenna installed in the serving BTS, φ_(s), is represented. Angle of arrivals, as well as antenna bearing and other angles, are measured counterclockwise from the x axis.

[0399] Now, by using the above teachings, optimal location algorithms according to the fourth embodiment using Cell Identity (CI) and Timing Advance (TA) Information are described.

[0400] The location problem in presence of CI and TA information can be formulated by minimizing the loss function defined as in (50), where CI and TA are the observations. The random variables which we want to estimate with a constant are indifferently the (x, y) coordinates or (ρ, θ) coordinates of the MS location.

[0401] If x and y are estimated, the PDFs of interest are f_(x|CI,TA)(x|CI,TA) and f_(y|CI,TA)(y|CI,TA). The estimation of ρ and θ is also possible because, since the CI of the serving BTS is an observation, the coordinates of the serving BTS are known; thus the polar reference system (ρ, θ) is completely defined (see the above section regarding the geometry of the problem). In case ρ and θ are estimated, the PDFs of interest are f_(ρ|CI,TA)(ρ|CI,TA) and f_(θ|CI,TA)(θ|CI,TA).

[0402] The definition of the location estimate depends on the choice for the loss function L(x) of equation (50).

[0403] First, the alternative is considered in which the loss function is L(x)=x².

[0404] Location Estimate in Cartesian Coordinates.

[0405] If the selected loss function is L(x)=x² and the MS location is estimated in the Cartesian coordinate system, the average risk is defined as follows

AR=E{(x−{circumflex over (x)})²+(y−ŷ)²|CI,TA|}  (56)

[0406] where {circumflex over (x)} and ŷ are the estimates of the x-y coordinates of the MS location. It can be easily shown that by equating to zero the partial derivatives dAR/d{circumflex over (x)} and dAR/dŷ, the following definitions for {circumflex over (x)} and ŷ result: $\begin{matrix} \left\{ \begin{matrix} {\hat{x} = {{E\left\{ {\left. x \middle| {CI} \right.,{TA}} \right\}} = {\int_{- \infty}^{+ \infty}{x\quad {f_{{x|{CI}},{TA}}\left( {\left. x \middle| {CI} \right.,{TA}} \right)}{x}}}}} \\ {\hat{y} = {{E\left\{ {\left. y \middle| {CI} \right.,{TA}} \right\}} = {\int_{- \infty}^{+ \infty}{y\quad {f_{{y|{CI}},{TA}}\left( {\left. y \middle| {CI} \right.,{TA}} \right)}{y}}}}} \end{matrix} \right. & (57) \end{matrix}$

[0407] where f_(x|CI,TA)(x|CI,TA) and f_(y|CI,TA)(y|CI,TA) are the probability density functions (PDFs) of the x and y coordinates conditioned by the values observed for CI and TA.

[0408] In general, f_(x|CI,TA)(x|CI,TA) and f_(y|CI,TA)(y|CI,TA) are marginal PDFs of the joint PDF f_(xy|CI,TA)(x,y|CI,TA). They can be calculated as follows: $\begin{matrix} \left\{ \begin{matrix} {{f_{{x|{CI}},{TA}}\left( {\left. x \middle| {CI} \right.,{TA}} \right)} = {\int_{- \infty}^{+ \infty}{{f_{{{xy}|{CI}},{TA}}\left( {x,\left. y \middle| {CI} \right.,{TA}} \right)}{y}}}} \\ {{f_{{y|{CI}},{TA}}\left( {\left. y \middle| {CI} \right.,{TA}} \right)} = {\int_{- \infty}^{+ \infty}{{f_{{{xy}|{CI}},{TA}}\left( {x,\left. y \middle| {CI} \right.,{TA}} \right)}{x}}}} \end{matrix} \right. & (58) \end{matrix}$

[0409] Thus, equation (57) becomes $\begin{matrix} \left\{ \begin{matrix} {\hat{x} = {\int_{- \infty}^{+ \infty}{{y}{\int_{- \infty}^{+ \infty}{x\quad {f_{{{xy}|{CI}},{TA}}\left( {\left. x \middle| {CI} \right.,{TA}} \right)}{x}}}}}} \\ {\hat{y} = {\int_{- \infty}^{+ \infty}{{x}{\int_{- \infty}^{+ \infty}{y\quad {f_{{{xy}|{CI}},{TA}}\left( {\left. y \middle| {CI} \right.,{TA}} \right)}{y}}}}}} \end{matrix} \right. & (59) \end{matrix}$

[0410] In practical terms, {circumflex over (x)} and ŷ calculated with (59) represent the mass center of a 2-dimensional region where the mass is distributed according to the PDF f_(xy|CI,TA)(x,y|CI,TA).

[0411] Location Estimate in Polar Coordinates.

[0412] If the CI of the cell is known also the coordinates of the serving BTS are known, thus it is possible to define the estimation problem in the polar reference system (ρ, θ). The MS coordinates can be estimated analogously as in (59) by substituting formally (x, y) with (ρ, θ): $\begin{matrix} \left\{ \begin{matrix} {\hat{\rho} = {\int_{- \pi}^{+ \pi}{{\theta}\quad {\int_{0}^{+ \infty}{{\rho_{{{\rho \quad \theta}|{CI}},{TA}}\left( {\rho,\left. \theta \middle| {CI} \right.,{TA}} \right)}{\rho}}}}}} \\ {\hat{\theta} = {\int_{- \infty}^{+ \infty}{\theta {\theta}\quad {\int_{0}^{+ \infty}{{f_{{{\rho \quad \theta}|{CI}},{TA}}\left( {\rho,\left. \theta \middle| {CI} \right.,{TA}} \right)}{\rho}}}}}} \end{matrix} \right. & (60) \end{matrix}$

[0413] where f_(ρθ|CI,TA)(ρ,θ|CI,TA) is the joint PDF of ρ and θ conditioned by the values observed for CI and TA. The location estimate in polar coordinates obtained with equation (60) minimizes the following average risk:

AR=E{(ρ−{circumflex over (ρ)})²+(θ−{circumflex over (θ)})² |CI,TA}  (61)

[0414] Next, the alternative is considered in which the loss function is L(x)=|x|.

[0415] If the loss function is L(x)=|x|, the location estimates in (x, y) coordinates and in (ρ, θ) coordinates are calculated as median values.

[0416] Location Estimate in Cartesian Coordinates.

[0417] The average risk is

AR=E{|x−{circumflex over (x)}|+|y−ŷ∥CI,TA}  (62)

[0418] and the resulting location estimate is given by

{circumflex over (x)}=median{x|CI,TA}; {circumflex over (y)}median{ y|CI,TA}  (63)

[0419] Location Estimate in Polar Coordinates.

[0420] The average risk is

AR=E{|ρ−{circumflex over (ρ)}|+|θ−{circumflex over (θ)}∥CI,TA}  (64)

[0421] and the resulting location estimate is given by

{circumflex over (ρ)}=median{ρ|CI,TA}; {circumflex over (θ)}=median{θ|CI,TA}  (65)

[0422] Equations (59) and (60) define the MS location estimates when the loss function to be minimized is L(x)=x². Equations (63) and (65) define the MS location estimates when the loss function to be minimized is L(x)=|x|. Disregarding the choice for the loss function, the location estimates are optimal in the sense that they minimize the average risk AR.

[0423] The location estimate is calculated from the distributions of (x, y) or (ρ, θ) conditioned by the observed values for CI and TA. In case the TA is not available, the same location algorithms can be used, provided that the PDFs used are the PDFs conditioned only by the observed CI value namely, f_(xy|CI,TA)(x,y|CI,TA) and f_(ρθ|CI,TA)(ρ,θ|CI,TA).

[0424] Such probability distributions reflect the spatial distribution of users using the timing advance TA when communicating with the cell identified by the CI. To characterize statistically the distribution of users might be difficult in practice, also because in principle the distribution of users in a cell changes with the time; during the day (rush hour or night); during the week (if the cell is serving a stadium with happenings only during week ends), seasonly, etc. However, when statistical data is available, it should be used and the algorithms derived above show how to estimate the MS location from it.

[0425] As a modification of the above described fourth embodiment, a location estimate can also be determined based only on the probability densities. That is, a location estimate can be found based on the location of the BTS and the probability density in the cell. In case sufficient information regarding the probability density are available, a suitable accurate location estimate can be obtained. This applies in particular when the different information described above (e.g., roads, population density, geographical information etc.) are combined.

[0426] The above description and accompanying drawings only illustrate the present invention by way of example. Thus, the embodiments may vary within the scope of the attached claims.

[0427] In particular, the embodiments and the modifications thereof can also be combined. For example, on order to have an even more reliable and accurate location estimate, the fourth embodiment can be combined with the first, second or third embodiment. In this way, probability density and neighbor base stations would be used for the location procedure.

[0428] Furthermore, it is again noted that the invention is not limited to GSM, but can also be applied to other mobile telecommunication systems like UMTS and the like. 

1. A method for locating a network element, comprising the steps of obtaining (Si) the coordinates (x_(s), y_(s)) of a second network element (BTS) to which the first network element (MS) is connected or attached; detecting (S2) a serving area (S), which is served by the second network element (BTS); detecting (S3) a propagation delay of the first network element with respect to the second network element (BTS); determining (S4) a propagation delay depending area (C), which is an area having a distance (R₁) to the second network element (BTS) based on the propagation delay and a width (R₂) based on the propagation delay; and forming (S5) an intersection area (I) of the serving area (S) and the propagation delay depending area (C); wherein a location estimate of the first network element (MS) is determined (S6) from the intersection area (I).
 2. The method according to claim 1, wherein the step of determining the propagation delay depending area (C) comprises the step of calculating an estimated distance and calculating a confidence interval for the estimated distance, wherein the propagation delay depending area (C) is determined based on the estimated distance and the confidence interval.
 3. The method according to claim 2, wherein the estimated distance and the confidence interval is calculated based on statistical data of the propagation delay.
 4. The method according to claim 3, wherein the statistical data comprises a propagation delay measurement error.
 5. The method according to claim 3, wherein the statistical data comprises the estimation error of the distance between the two network elements as obtained by comparing the true distance and the distance estimated using the propagation delay.
 6. The method according to claims 3, 4 or 5, wherein already available location information of the first network element is used to form the statistical data.
 7. The method according to claim 6, wherein the already available location information of the first network element is obtained using other, more accurate location methods, such as Enhanced Observed Time Difference (E-OTD), Angle OF Arrival (AOA), GPS, or Assisted-GPS.
 8. The method according to claim 1, wherein the propagation delay is indicated by a Timing Advance (TA).
 9. A method for locating a network element, comprising the steps of obtaining the identity of a second network element (BTS) to which the first network element (MS) is connected or attached; detecting a serving area (S), which is served by the second network element (BTS); wherein a location estimate of the first network element (MS) is determined from the serving area (S).
 10. The method according to claim 1 or 9, wherein the serving area (S) is a geographical area to which the second network element (BTS) is associated.
 11. The method according to claim 1 or 9, wherein the serving area (S) is defined by a geographical map.
 12. The method according to claim 1 or 9, wherein the serving area (S) is the geographical region the borders of which are mathematically defined by the coordinates of the origin (x₀,y₀), the orientation of the serving area measured taking (x₀,y₀) as origin of a polar reference φ_(s), the angular width of the serving area Δφ_(s), a front radius (R_(F)) which defines the distance from the origin (x₀,y₀) in the angular region inside the range φ_(s)±φ_(s), and a back radius (R_(B)) which defines the distance from the origin (x₀,y₀) in the angular region outside the range φ_(s)±φ_(s).
 13. The method according to claim 1 or 9, wherein the step of obtaining the coordinates of the second network element (BTS) is performed by checking a Cell Identity (CI) of the cell the second network element is associated to.
 14. The method according to claim 1, wherein calculation of location estimates in dependence on the coordinates of the second network element and the propagation delay is performed beforehand.
 15. The method according to claim 9, wherein calculation of location estimates in dependence on the serving area of the second network, is performed beforehand.
 16. The method according to claim 14, further comprising the step of storing the location estimates calculated beforehand in look-up tables, wherein the location estimates can be retrieved based on the coordinates or identity of the second network element and the propagation delays.
 17. The method according to claim 12, further comprising the step of storing the location estimates calculated beforehand in look-up tables, wherein the location estimates can be retrieved based on the identity of the second network element.
 18. The method according to claim 1 or 9, wherein the first network element (MS) is a mobile station.
 19. The method according to claim 1 or 9, wherein the second network element (BTS) is a base station.
 20. The method according to claim 1, further comprising the steps of identifying neighbor network elements (NI₁, . . . , NI_(N)), which can be received by the first network element, and obtaining hearablity areas (H₁, . . . , H_(N)) defining areas in which the signal level of neighbor network elements is equal or higher than a predetermined signal level, wherein the step of forming an intersection area (I) comprises forming an intersection area of the serving area (S), the propagation delay depending area (C) and the hearablity areas of those neighbor network elements identified by the first network element (MS).
 21. A method for locating a network element, comprising the steps of identifying neighbor network elements (NI₁, . . . , NI_(N)), which can be received by the first network element, and obtaining hearablity areas (H₁, . . . , H_(N)) defining areas in which the signal level of neighbor network elements is equal or higher than a predetermined signal level, and forming an intersection area of the hearablity areas of those neighbor network elements identified by the first network element (MS), wherein a location estimate of the first network element (MS) is determined from the intersection area (I).
 22. The method according to claim 9, further comprising the steps of identifying neighbor network elements (NI₁, . . . , NI_(N)), which can be received by the first network element, and obtaining hearablity areas (H₁, . . . , H_(N)) defining areas in which the signal level of neighbor network elements is equal or higher than a predetermined signal level, wherein the step of forming an intersection area (I) comprises forming an intersection area of the serving area (S), and the hearablity areas of those neighbor network elements.
 23. A method for locating a network element, comprising the steps of obtaining the coordinates (x_(s), y_(s)) and of a second network element (BTS) to which the first network element (MS) is connected or attached; detecting a propagation delay of the first network element with respect to the second network element (BTS); determining a propagation delay depending area (C), which is an area having a distance (R₁) to the second network element (BTS) based on the propagation delay and a width (R₂) based on the propagation delay; and identifying neighbor network elements (NI₁, . . . , NI_(N)), which can be received by the first network element, and obtaining hearablity areas (H₁, . . . , H_(N)) defining areas in which the signal level of neighbor network elements is equal or higher than a predetermined signal level, forming an intersection area (I) of the propagation delay depending area (C) and the hearablity areas of those neighbor network elements; wherein a location estimate of the first network element (MS) is determined from the intersection area (I).
 24. The method according to claim 20, 21, or 22, wherein the hearability area of each neighbor network element is stored beforehand in a database, and wherein the step of obtaining the hearbility areas is performed by accessing the database.
 25. The method according to claim 20, 21, or 22, wherein in the identifying step the strength (RXLEV) of a signal received from a neighbor network element is measured by the first network element on the Broadcast Common Control Channel (BCCH) frequency of the neighbor network element.
 26. The method according to claim 20, 21 or 22, wherein in the step of obtaining the hearability areas the hearability areas are ordered in dependence on the received signal strength, and wherein in the step of forming the intersection area the order is considered.
 27. The method according to claim 20, 21, or 22, wherein for each neighbor cell a plurality of coverage areas are provided each of which has a different signal level, wherein the step of forming an intersection is performed by using the coverage areas having different signal levels.
 28. A method for locating a network element, comprising the steps of obtaining the coordinates (x_(s), y_(s)) of a second network element (BTS) to which the first network element (MS) is connected or attached; and using information about a probability density of locations of first network elements, wherein a location estimate of the first network element (MS) is determined from the probability.
 29. The method according to claim 1, 9, 20, 21 or 22, comprising the step of using information about a probability density of locations of first network elements.
 30. The method according to claim 28 or 29, wherein the probability density information comprises empirical user density studies.
 31. The method according to claim 28 or 29, wherein the probability density information comprises geographical information.
 32. The method according to claim 28 or 29, wherein the probability density information comprises population density information.
 33. The method according to claim 28 or 29, wherein the probability density information comprises traffic information.
 34. The method according to claim 28 or 29, wherein the probability density information are stored beforehand in a database for each serving area (S).
 35. The method according to claim 1, 9, 20, 21 or 22, wherein the location estimate of the first network element is the center point of the intersection area.
 36. The method according to claim 28 or 29, wherein the location estimate of the first network element is the weighted center point of the intersection area using probability density of locations of first network elements as weight.
 37. The method according to claims 1, 20, 21 or 22, wherein the confidence area of the first network element, where the first network element is located with a certain probability, is estimated using the intersection area.
 38. The method according to claim 37, where the confidence area estimate is the intersection area.
 39. The method according to claim 9, wherein the confidence area of the first network, where the first network element is located with a certain probability, is estimated using the serving area.
 40. The method according to claim 39, where the confidence area estimate is the serving area.
 41. A network control device for locating a first network element (MS), comprising a serving area determining means being adapted to obtain coordinates (x_(s), y_(s)) of a second network element, (BTS) to which the first network element (MS) is connected or attached, and to detect a serving area (S), which is served by the second network element (BTS); a propagation delay depending area detecting means being adapted to detect a propagation delay of the first network element with respect to the second network element (BTS), and to determine a propagation delay depending area (C), which is an area having a distance (R₁) to the second network element (BTS) based on the propagation delay and a width (R₂) based on the propagation delay; and a location estimating means being adapted to form an intersection area (I) of the serving area (S) and the Propagation delay depending area (C); and to determine a location estimate of the first network element (MS) from the intersection area (I).
 42. The network control device according to claim 41, wherein the propagation delay depending area detecting means is adapted to calculate an estimated distance and calculate a confidence interval for the estimated distance, wherein the propagation delay depending area (C) is determined based on the estimated distance and the confidence interval.
 43. The network control device according to claim 42, wherein the estimated distance and the confidence interval is calculated based on statistical data of the propagation delay.
 44. The network control device according to claim 43, wherein the statistical data comprises a propagation delay measurement error.
 45. The network control device according to claim 43, wherein the statistical data comprises the estimation error of the distance between the two network elements as obtained by comparing the true distance and the distance estimated using the propagation delay.
 46. The network control device according to claims 43, 44 or 45, wherein already available location information of the first network element is used to form the statistical data.
 47. The network control device according to claim 46, wherein the already available location information of the first network element is obtained using other, more accurate location methods, such as Enhanced Observed Time Difference (E-OTD), Angle OF Arrival (AOA), GPS, Assisted-GPS etc.
 48. The network control device according to claim 41, wherein the propagation delay is indicated by a Timing Advance (TA).
 49. A network control device for locating a first network element (MS), comprising a serving area determining means being adapted to obtain coordinates (x_(s), y_(s)) of a second network element, (BTS) to which the first network element (MS) is connected or attached, and to detect a serving area (S), which is served by the second network element (BTS); and a location estimating means being adapted to determine a location estimate of the first network element (MS) from the serving area (S).
 50. The network control device according to claim 41 or 49, wherein the serving area (S) is a geographical area to which the second network element (BTS) is associated.
 51. The network control device according to claim 41 or 49, wherein the serving area (S) is defined by a geographical map.
 52. The network control device according to claim 41 or 50, wherein the serving area determining means is adapted to determine the serving area (S) as the geographical region the borders of which are mathematically defined by the coordinates of the origin (x₀,y₀), the orientation of the serving area measured taking (x₀,y₀) as origin of a polar reference φ_(s), the angular width of the serving area Δφ_(s), a front radius (R_(F)) which defines the distance from the origin (x₀,y₀) in the angular region inside the range φ_(s)±Δφ_(s), and a back radius (R_(B)) which defines the distance from the origin (x₀,y₀) in the angular region outside the range φ_(s)±Δφ_(s).
 53. The network control device according to claim 41 or 49, wherein the serving area determining means performs obtaining the coordinates of the second network element (BTS) by checking a Cell Identity (CI) of the cell the second network element is associated to.
 54. The network control device according to claim 41, wherein calculation of location estimates in dependence on coordinates of the second network element and propagation delays is performed beforehand.
 55. The network control device according to claim 49, wherein calculation of location estimates in dependence on the serving area of the second network is performed beforehand.
 56. The network control device according to claim 54, further comprising a look-up table retrieving device adapted to access a look-up table storing location estimates which have been calculated beforehand, wherein the look-up table retrieving device is adapted to retrieve the location estimates based on the coordinates of the second network element and the propagation delay.
 57. The network control device according to claim 55, further comprising a look-up table retrieving device adapted to access a look-up table storing location estimates which have been calculated beforehand, wherein the look-up table retrieving device is adapted to retrieve the location estimates based on the coordinates of the second network element.
 58. The network control device according to claim 41 or 49, wherein the first network element (MS) is a mobile station.
 59. The network control device according to claim 41, wherein the second network element (BTS) is a base stations.
 60. The network control device according to claim 41, further comprising a hearability determining means being adapted to identify neighbor network elements (NI₁, . . . , NI_(N)), which can be received by the first network element, and to obtain hearablity areas (H₁, . . . , H_(N)) defining areas in which the signal level of neighbor network elements is equal or higher than a predetermined signal level, wherein the location estimating means is adapted to form the intersection area (I) of the serving area (S), the propagation delay depending area (C) and the hearablity areas of those neighbor network elements identified by the first network element (MS).
 61. A network control device for locating a first network element (MS), comprising a hearability determining means being adapted to identify neighbor network elements (NI₁, . . . , NI_(N)), which can be received by the first network element, and to obtain hearablity areas (H₁, . . . , H_(N)) defining areas in which the signal level of neighbor network elements is equal or higher than a predetermined signal level, a location estimating means being adapted to form an intersection area (I) the hearablity areas of those neighbor network elements identified by the first network element (MS).
 62. The network control device according to claim 49, further comprising a hearability determining means being adapted to identify neighbor network elements (NI₁, . . . , NI_(N)), which can be received by the first network element, and to obtain hearablity areas (H₁, . . . , H_(N)) defining areas in which the signal level of neighbor network elements is equal or higher than a predetermined signal level, wherein the location estimating means is adapted to form the intersection area (I) of the serving area (S) and the hearablity areas of those neighbor network elements identified by the first network element (MS).
 63. The network control device according to claim 60, 61 or 62, further comprising a hearability area database in which the hearability area of each neighbor network element is stored beforehand, and wherein the hearability determining means obtain the hearbility areas by accessing the database.
 64. The network control device according to claim 60, 61 or 62, wherein the hearability determining means is adapted to measure the strength (RXLEV) of a signal received from a neighbor network element on the Broadcast Common Control Channel (BCCH) frequency of the neighbor network element.
 65. The network control device according to claim 60, 61 or 62, wherein the hearability determining means is adapted to order the hearability areas in dependence on the received signal strength, and wherein the order of the hearability areas is considered when forming the intersection area the order.
 66. The network control device according to claim 60, 61 or 62, wherein for each neighbor cell a plurality of coverage areas are provided each of which has a different signal level, wherein location estimating means performs forming an intersection by using the coverage areas having different signal levels.
 67. The network control device according to claim 43, 49, 60, 61 or 62, wherein the location estimating means is further adapted to use information about a probability density of locations of first network elements.
 68. The network control device according to claim 67, wherein the probability density information comprises empirical user density studies.
 69. The network control device according to claim 67, wherein the probability density information comprises geographical information.
 70. The network control device according to claim 67, wherein the probability density information comprises population density information.
 71. The network control device according to claim 67, wherein the probability density information comprises traffic information.
 72. The network control device according to claim 67, wherein the probability density information are stored beforehand in a database for each serving area (S).
 73. The network control device according to claim 41, 49, 60, 61 or 62, wherein the location estimating means is adapted to determine the location estimate of the first network element as the center point of the intersection area.
 74. The network control device according to claim 49, wherein the location estimating means is adapted to determine the location estimate of the first network element as the center point of the serving area.
 75. The network control device according to claim 67, wherein the location estimating means is adapted to determine the location estimate of the first network element as the weighted center point of the intersection area using probability density of locations of first network elements as weight.
 76. The network control device according to claims 41, 60, 61 or 62, wherein location estimating means is adapted to estimate the confidence area of the first network element, where the first network element is located with a certain probability, using the intersection area.
 77. The network control device according to claim 76, where the confidence area estimate is the intersection area.
 78. The network control device according to claim 49, wherein location estimating means is adapted to estimate the confidence area of the first network, where the first network element is located with a certain probability, using the serving area.
 79. The network control device according to claim 78, where the confidence area estimate is the serving area.
 80. The network control device according to claim 42, wherein the network control device is a Location Server (LS).
 81. A network location system comprising a network control device (LS) according to claim 80, and a network management device (LMT) for preparing the look-up table.
 82. The network location system according to claim 81, wherein the network management device is a Location Management Tool (LMT). 